Hi Bruce,
You wrote to David Noon:
BW>One point worth mentioning, that is on topic.  There is
BW>nothing in the standard that says qsort() has to be a quick
BW>sort algorithm.  For all we know, Borland uses bubble sort.
Borland uses quickersort (quicksort with median of three key selection
and insertion sort if the partition has less than 7 elements) in Borland
C/C++ V3.1 (I've got the library source). I doubt if they'd change it
in later releases.
George
 * SLMR 2.1a * Wastebasket: Something to throw things near.
--- Maximus/2 3.01
---------------