[Python-3000] BList PEP (original) (raw)

Paul Moore p.f.moore at gmail.com
Tue May 1 17:42:04 CEST 2007


- 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.



More information about the Python-3000 mailing list