Hi Jack,
No, you're right. 8-)
An indexed file would be a better approach given CSJedi could reorganize his file to meet my requirement of monotonicity in his file's data. Sound's like primary key to me. 8-)
I've just got relative files on the brain as the current project I'm working uses...
Hi Jack,
If the file can be organized the way I stated with no missing records then the number of records can be determined with a WRITE record followed by a DELETE record. The WRITE will set the relative record key to the current (last) record in the file. Save the key value, DELETE this last...
If your file can be organized as a relative file, you can implement a binary search
of the file by manipulating the relative record number. Doing so assumes that the
file's record sequence is intact, record 1 to record N with no missing records. The
data in the file's records must also have a...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.