phil on 11 March 2008
fkusumot said:
So you would make a hash table for every single possibility? That sounds very innefficient. |
It is inefficient. I guess you don't have to populate an entire hash/array(I may have misinterpreted how your data is present in the file), but your program is still going to be insanely inefficient because you're searching through 1.3 million records in a flat text file, so you probably wouldn't notice much difference unless the record you're looking for happens to be near the top of the file.