Hello All!
I'm starting to work on a program that'll potentially handle some fairly 
large linked lists.
I'd like some ideas on sorting doubly-linked lists (next/previous record on 
one field), and on handling them in memory, as each record will be 
150* string[90]+ an estimated (rough guess :-) 500bytes in other fields (and 
no, the 150*90 is not absolutely necessary, but to have the program work as 
planned it *is* necessary).
I want to be able to read the records from disk, manipulate them 
(edit/sort/delete/copy), but don't have any huge need for more than one to be 
in memory at a time except during the sorting phase. I'd also like to know 
how to handle 'CASE' statements within records, as I know they can be done 
but have never used them. This program will have important changes depending 
on which particular file is used(up to 3, two varying slightly the third 
varying majorly - probably use a seperate record for that).
I've got very little information on lists, but I am familliar enough with 
them to know what they do and have a limited idea of how to use them..
Oh, some help on maintaining a seperate index file would also be nice.
Thanx in advance for any help with this.
Dave
Save your BBS! Join INTBBS_WK now! 
--- timEd 1.10
---------------