Sorting

["Metz, Zak" <Zak_Metz@xxxxxx>]

I need to sort some files. The sorts are dynamic and the keying will
only be known at run-time. The files often have multi-million record
counts and an average reclen of something like 1k.

I will be starting with a PF and need to either sort into a 2nd PF or
preferably back into the same PF. Those are requirements that I have no
control over.

Currently this is done with FMTDTA, but we are running into the key
length limitation, and so looking for other solutions.

Thoughts:

1. Create an LF and copy from that into a 2nd PF.
- But I would have to write DDS source, compile it, then copy, then
delete the LF. Too many steps.

2. Build an OPNQRYF string and copy from that into a 2nd PF.
- But building the OPNQRYF string is tedious and error-prone.

3. Write something in C to drive QSORT(), sorting back into the original
file.
- Seems like a good idea, but do I really want to process a
multi-million record file this way?

4. Use some other "canned" sorting function.

Any comments on these methods, or any other ideas? The OPNQRYF is the
only option I can think of that is somewhat "clean."
NOTICE: This E-mail may contain confidential information. If you are not
the addressee or the intended recipient please do not read this E-mail
and please immediately delete this e-mail message and any attachments
from your workstation or network mail system. If you are the addressee
or the intended recipient and you save or print a copy of this E-mail,
please place it in an appropriate file, depending on whether
confidential information is contained in the message.