On 5/1/07, Paul Moore <[EMAIL PROTECTED]> 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 _______________________________________________ Python-3000 mailing list Python-3000@python.org http://mail.python.org/mailman/listinfo/python-3000 Unsubscribe: http://mail.python.org/mailman/options/python-3000/archive%40mail-archive.com
