[Python-3000] BList PEP

[Paul Moore]

> - Implement TimSort for BLists, so that best-case sorting is O(n)
>  instead of O(log n).

Is that a typo? Why would you want to make best-case sorting worse?
Paul.