RE: Sorting a Multi-occurrence data structure

[Scott Mildenberger <Smildenber@xxxxxxxxxxxx>]

Don,

You provide the procedure that qsort uses to compare elements in order to
sort the list.  The procedure you provide can use any element in doing the
comparison.

Scott Mildenberger

> -----Original Message-----
> From: Fisher, Don [mailto:Dfisher@roomstoreeast.com]
> Sent: Tuesday, November 12, 2002 12:04 PM
> To: 'rpg400-l@midrange.com'
> Subject: Sorting a Multi-occurrence data structure
>
>
> I would like to sort a multi-occurrence data structure
> containing, say, four
> fields, using the third field in the data structure.  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.
>
> The other alternative involves the use of an API called
> QLGSORT, but I'm
> leery of that as I have not done any API programming before.
>
> Are there any other alternatives or does someone have an
> example of using
> QLGSORT?