Chuck, if what you wanted was to look at the code to see how it's done this won't help but.....
<AD for MERGE.LIST> I've used MERGE.LIST which is very effective. I've written programs which sort and merge many subsets just by executing this utilities and then doing the good ol' READLIST. SELECT PARTS BY REV.NO SAVING REV.NO TO 1 SELECT VENDOR.PARTS BY VEN.REV SAVING VEN.REV TO 2 MERGE.LIST 1 UNION 2 Or MERGE.LIST 1 DIFFERENCE 2 You can go on forever ..... (or at least I've gone up to 9 lists.) SSELECT is best if you can use file ID's. Even if you don't have a file structure already built, you can create a temp file, write your data elements to be sorted out as ID's then use SSELECT. Amazing what some programmers will do to avoid writing code :-) -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Chuck Mongiovi Sent: Friday, July 23, 2004 2:46 PM To: [EMAIL PROTECTED] Subject: [U2] merge sort Does anyone know where I can get code for a generic BASIC Merge SORT routine? -Chuck ------- u2-users mailing list [EMAIL PROTECTED] To unsubscribe please visit http://listserver.u2ug.org/ ------- u2-users mailing list [EMAIL PROTECTED] To unsubscribe please visit http://listserver.u2ug.org/
