JdBP>> set of combs with progressively finer teeth.
 DN> [snip]
 DN> MB>Except that this is with sorts, monolithic sorts vs. 
 DN> divide-and-conquer
 DN> MB>sorts. It brings some freshness into the monolithic sorts camp.
 DN> It isn't that fresh. The idea was originally published by Donald Shell 
 DN> about
 DN> 35 years ago. The code for the Shellsort algorithm I posted uses the 
ame
 DN> idea as Combsort, but applied to insertion sort instead of bubble sort.
 DN> Shellsort should run a little faster than Combsort.
The main problem behind all this is that my university is stupid and
they don't teach us stuff like that. Our vision is that in a few years
it will be called Microsoft University. We're really pessimistic.
 DN> I use Shellsort as my default sorting algorithm. Since it performs
 DN> respectably on any data stream, I call it the "Swiss army knife" of sort
 DN> algorithms.
i'll remember that. :-)
matju
--- Terminate 4.00/Pro
---------------