Large Dictionaries

[Aahz]

In article <ldo-12AAC2.21275705062006 at lust.ihug.co.nz>,
Lawrence D'Oliveiro  <ldo at geek-central.gen.new_zealand> 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?

Read some of the old discussions in the python-dev archives.
-- 
Aahz (aahz at pythoncraft.com)           <*>         http://www.pythoncraft.com/

"I saw `cout' being shifted "Hello world" times to the left and stopped
right there."  --Steve Gonedes