"Stephen T. Pope" wrote:

> SortedCollections assign a default sort block if none is provided. Since
> 90% of these blocks are the same, we can save one block activation per
> sort comparison if we code the comparison directly for collections where
> the sort block is nil. The attached change set implements this; the
> speed-up is quite significant for large collections (>100% for 50000
> items in random order).

Another very fast way to sort is to use the Heap class, which Andreas
added to Squeak in one update.

Michael

-- 

 "To improve is to change, to be perfect is to change often." 
                                            Winston Churchill
+------------------------------------------------------------+
| Michael Rueger                                             |
| Phone: ++1 (818) 623 3283        Fax:   ++1 (818) 623 3559 |
+---------- Michael.Rueger.-ND at corp.go.com ------------------+