In a message dated 03-20-98, Mathieu Bouchard said to Jonathan de Boyne
Pollard about Sort Algorithm
Hi Mathieu,
 JdBP> set of combs with progressively finer teeth.
[snip]
MB>Except that this is with sorts, monolithic sorts vs. divide-and-conquer
MB>sorts. It brings some freshness into the monolithic sorts camp.
It isn't that fresh. The idea was originally published by Donald Shell about
35 years ago. The code for the Shellsort algorithm I posted uses the same
idea as Combsort, but applied to insertion sort instead of bubble sort.
Shellsort should run a little faster than Combsort.
I use Shellsort as my default sorting algorithm. Since it performs
respectably on any data stream, I call it the "Swiss army knife" of sort
algorithms.
Regards
Dave

___
 * MR/2 2.25 #353 * Windows, icons, mouse and pointer = WIMP
--- Maximus/2 3.01
---------------