|
I'd be willing to bet that 90% of the programers who will see or who will be asked to maintain/enhance the File/Program/Algorithm would rather maintain a RPGII Level Breaking Matching record program. But I might be wrong. John Carr >Booth, >Since the records are sorted in the order that you want to search, >you can use a binary search technique. It basically works by >eliminating half of the remaining records on each pass and is much >faster than you might think, even on very large files. If you need >specifics on the algorithm, let me know. On Sun, 30 Mar 97 13:26:38, boothm@earth.goddard.edu wrote: >I'm thinking there's gotta be an easy way to do this. > >I have a sequential file, sorted into alphabetical order on a field called >"LastName". I want to process it as a subfile by Relative Record Number. > >But a user needs to be able set the file at a particular "LastName", >based on a keyed-in field called "GetName". > >Is there an easy way to do that? >Thanks. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This is the Midrange System Mailing List! To submit a new message, * * send your mail to "MIDRANGE-L@midrange.com". To unsubscribe from * * this list send email to MAJORDOMO@midrange.com and specify * * 'unsubscribe MIDRANGE-L' in the body of your message. Questions * * should be directed to the list owner / operator: david@midrange.com * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.