Author: Dann Corbit
Date: 14:33:07 10/18/99
Go up one level in this thread
On October 18, 1999 at 17:20:01, Dave Gomboc wrote: >On October 18, 1999 at 13:49:26, Dann Corbit wrote: > >>On October 17, 1999 at 17:07:30, Ricardo Gibert wrote: >>[snip] >>>>And bubblesort has the advantage of being the best algorithm to sort already >>>>ordered lists. >>> >>>Shaker sort does this faster. >>Linear insertion is also faster and binary insertion even faster. Quick sort >>with Singleton's modification should not be used for partitions smaller than 20 >>elements. > >I'm surprised that nobody has brought up introsort yet. P. J. Plauger recently created a very nice version of introspective sort which he used for a qsort() interface. It was published somewhere recently (DDJ IIRC).
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.