Large Dictionaries

[Lawrence D'Oliveiro]

In article <1149517720.086866.3510 at j55g2000cwa.googlegroups.com>,
 "Iain King" <iainking at gmail.com> wrote:

>Lawrence D'Oliveiro wrote:
>> In article <447af556$1 at nntp0.pdx.net>,
>>  Scott David Daniels <scott.daniels at acm.org> 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". :)