[Python-3000] BList PEP

Daniel Stutzbach daniel at stutzbachenterprises.com
Tue May 1 17:46:36 CEST 2007

On 5/1/07, Paul Moore <p.f.moore at gmail.com> wrote:
> > - 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?

Yes, it should read O(n log n), not O(log n).

Daniel Stutzbach, Ph.D.             President, Stutzbach Enterprises LLC

More information about the Python-3000 mailing list