Re: Smart sorting algorithm ?

[Wilhelm Spickermann <wilhelm.spickermann@spickermann-d.de>]

--Am Dienstag, Juli 02, 2002 11:32:01 -0500 schrieb Wes Groleau 
<wesgroleau@despammed.com>:

>
> Anyone know anything about a sorting algorithm
> that includes the ability to infer the answer
> to a comparison from comparisons already done?
>
> The reason I'm asking is that I have a situation
> where deciding the order of two items is very slow.
>
> If the program determines that A < B  and later
> determines that B < C and stores this information,
> then if and when A ? C comes up, it can determine
> the answer from the stored information.
>
> I have ideas for two ways to do this, but
> if it's already been done.....
>

Hi,

have a look into D.E.Knuth: The Art of Computer Programming, Vol 
3: Sorting and Searching. Subsection 5.3.1: Minimum Comparison 
Sorting.

Wilhelm