RE: Sorting a user space

Rob,
Here are two articles that have already been written and published on the
topic.

http://www.mcpressonline.com/mc?1@xxxxxxxxxxxxxxxx@.6b17243a

http://www.mcpressonline.com/mc?1@xxxxxxxxxxxxxxxx@.6ae93a66


-Bob Cozzi
www.RPGxTools.com
RPG xTools - Enjoy programming again.


-----Original Message-----
From: rpg400-l-bounces+cozzi=rpgiv.com@xxxxxxxxxxxx
[mailto:rpg400-l-bounces+cozzi=rpgiv.com@xxxxxxxxxxxx] On Behalf Of Hewitt,
Rory
Sent: Tuesday, September 13, 2005 1:45 PM
To: rpg400-l@xxxxxxxxxxxx
Subject: RE: Sorting a user space

Rob,

Obvious choice here would be qsort() (and bsearch() if you subsequently
want to search the array). There are some basic examples in the
Sorcerers Guide.

I believe Scott is doing an article in the December issue of iSeries
News about the various different sorting/searching methods - how well
they perform, how easy they are to implement & code etc.

Also, I have written an article which will appear in the November issue
of iSeries News which shows how to easily 'wrapper' the qsort() and
bsearch() API's into a service program which requires no additional
coding of callback procedures etc, as well as allowing sorting/searching
using case-insensitivity, subsetted data, *LT/*LE/*EQ/*GE/*GT searching
etc.

Both these will be too late for you right now, but if you email me, I
can send you the code that will appear in the article - you might find
it useful: rory dot hewitt at ca dot com.

Having said all of the above, basic loading into an array and then
sorting the array using SORTA will probably perform just as well as the
more esoteric methods, unless you're talking about tens of thousands of
array elements...

HTH,

Rory