Large Dictionaries

[Steve Holden]

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?

Isn't that just your definition of "reasonable"?

regards
  Steve
-- 
Steve Holden       +44 150 684 7255  +1 800 494 3119
Holden Web LLC/Ltd          http://www.holdenweb.com
Love me, love my blog  http://holdenweb.blogspot.com
Recent Ramblings     http://del.icio.us/steve.holden