P Witte wrote: > IIRC the resulting sort is "stable" allowing for an unambiguous fast binary > search (also included) of the array(s) using the same criteria as for the > sort. (That was at least my programming goal. I'll have to check this, > though.) > Sorry? I don't think I follow your banter. A stable sort is one where records with equal keys remain in the same order after the sort as they were before it. I'm certain that quicksort cannot do that.
_______________________________________________ QL-Users Mailing List http://www.q-v-d.demon.co.uk/smsqe.htm
