On Wed, 1 May 2002, Hannes Hirzel wrote:

> Bob Arning  <arning at charm.net> wrote:
> > Hi all,
> >
> > Is the following a known and accepted feature of our sorting algorithm?
> >
> > [((1 to: 10000) collect: [ :x | x]) asSortedCollection] timeToRun ==> 98
> >
> > [((1 to: 10000) collect: [ :x | 3]) asSortedCollection] timeToRun ==> 20826
> >
>
> Are there sorting specialists out there?
>

Maybe....

But why not run a it under MessageTally and paste the results? That should
almost immediately indicate what parts of the code are to blame.

Scott