In a message dated 04-09-98, George White said to David Noon about Multiple
Key Sorts
Hi George,
GW>Sure it is, but you _still_ can't count :-).
Can't see, actually. [Literally. I hadn't treated my contact lenses when I
read Tom's message, so I was "flying blind" so to speak.]
GW>bound, while Toms increments the start of the inner loop (things are
I "saw" the inner loop starting from zero.
GW>Mind you, sorting data on two separate keys is the _major_ limitation of
GW>quicksort, as it does _not_ keep items with the same key in the same
GW>order as in the original data. So, if sorting data on two or more keys,
GW>a different sort is required and neither quicksort or Shellsort are
GW>suitable (but insertion sort is ).
We open a whole new can of worms once we introduce multiple sort keys.
Especially if some are ascending and some are descending. This makes custom
comparisons worthwhile. The efficient implementation of same will be worthy
of another message thread, same time next year. ... :-)
[code snipped]
Regards
Dave

___
 * MR/2 2.25 #353 * Win3.1? For fast relief call 800-3-IBM-OS2.
--- Maximus/2 3.01
---------------