On 5/1/07, Terry Reedy <[EMAIL PROTECTED]> wrote: > "Daniel Stutzbach" <[EMAIL PROTECTED]> wrote in message > news:[EMAIL PROTECTED] > | Sort O(n log n) O(n log n) > > Tim Peters' list.sort is, I believe, better than nlogn for a number of > practically important special cases. I believe he documented this in the > code comments. Can you duplicate this with your structure?
The table in the PEP lists worst-case execution times. I'll make that explicit in the next revision. You are correct that TimSort is O(n) for nearly-sorted lists. It's possible to implement TimSort over the BList, but I have not yet done so. -- 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
