Sorting a Multi-occurrence data structure

["Jon Paris" <Jon.Paris@xxxxxxxxxxxxxx>]

 >> After searching the archives and reading the example in the "Sorcerer's
Guide", it appears that the QSORT routine needs the sort field to be the
first in the data structure
as there is no parameter for the starting position and length of the sort
field.

Guess my explanation of qsort in the Sorcerer's Guide was not as clear as I
thought it was.

qsort (you must spell it that way) sorts on _any_ part of the structure, or
for that matter any combination of fields in the structure.  There is no
need for a length or start position parm because _your_ code in the
subprocedure actually makes all of the sequence decisions.  Your routine is
passed the start addresses of a pair of elements.  You use your own logic to
decide which of the two is the higher in the sort sequence.  Simple as that!

Jon Paris
Partner400