In article <[EMAIL PROTECTED]>, Scott David Daniels <[EMAIL PROTECTED]> wrote:
>For example, time timsort (Python's internal sort) on pre-sorted >data; you'll find it is handled faster than random data. But isn't that how a reasonable sorting algorithm should behave? Less work to do if the data is already sorted? -- http://mail.python.org/mailman/listinfo/python-list
