I am usig the V119 routine to sort an array. Under program control I build the array based on user input. The user can indicate 1 - 10 sort fields.

The record count is now 4,500 and this results in the array exceeding the 64k limit.

I would appreciate advice on how to reslove this.

Mark

Mark,

V119 can be set up to sort arrays in external DOS files so it is possible to exceed the 64K barrier. The process is significantly more complex than a single V119 call (you will actually make various V119 calls this way) but the end result is still relatively fast. I believe SysKnowledge article R38 has some pseudo code for this.

[email protected]

SRP Computer Solutions

You might have to OSBWRITE the array to file, soft the file via an external sort utility, then read it back in.

Another way might be to compress the strings to sort (say if your keys are all numeric). Let's say your keys have 4 digits, you can compress the key value with code like:

TINY.KEY=CHAR(KEY1,2):CHAR(KEY3,2)

Then sort,

Then uncompress with:

KEY =FMT(SEQ(TINY.KEY1,1),'R(0)#2'))

KEY := FMT(SEQ(TINY.KEY2,1),'R(0)#2'))

KEY=INT(KEY)

There are other similiar techniques, but this might give you some

ideas.

Another possibility is to place the keys in a non-delimited array, and write your own qsort routine based on elements at an offset, rather than at a certain field.

Another idea would be to write all the keys to a temp file & let AREV's sort statement handle it for you. The temp file could be located on a ramdisk for extra speed.

Steve

Steve,

Thank you for the very helpful ideas.

Mark

Thanks Don I'll checkout your suggestion.

Mark

View this thread on the forum...