Re: Smart sorting algorithm ?

[dewar@gnat.com (Robert Dewar)]

Wes Groleau <wesgroleau@despammed.com> wrote in message news:<3D2D98DB.39944A80@despammed.com>...
> 
> The lookup table is created by doing the comparisons.
> And predicting some comparisons from others.
> Once that's done, the row with the N "this is first"
> entries is first.  Second is the row with N-1, etc.
> But the whole process still involves some comparisons.

Once again, this is a dead-end idea. It cannot possibly
be any help if you are using a good sorting algorithm
that minimizes comparisons in the first place, and if
minimizing comparisons is desirable, then that should
be the starting point, and you should forget about this
kludging around trying to repair bad sorting algorithms.