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