In article <[EMAIL PROTECTED]>, "Iain King" <[EMAIL PROTECTED]> wrote:
>Lawrence D'Oliveiro wrote: >> 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? > >An already sorted list can be pathological for Quicksort, depending on >how you code it. I did say "reasonable". :) -- http://mail.python.org/mailman/listinfo/python-list
