Laurence Reeves writes: <> > In reply to Per's comments earlier, as Norman in effect says, quicksort > is *not* a good all-rounder.
and <> > The raw figures are at <http://www.bergbland.info/2secs.txt> and here. <> Your figures seem to be saying the opposite of what you write! And what is the problem with a stack of pointers growing to ln(n) when (as in practice here) n is max 32k? (The latter refers to a non-recursive implementation. The worst case for a poor recursive imlementation can, indeed, be n) Per _______________________________________________ QL-Users Mailing List http://www.q-v-d.demon.co.uk/smsqe.htm
