Click here to Skip to main content
15,881,204 members
Please Sign up or sign in to vote.
1.00/5 (3 votes)
See more:
I have a text file. This file contains two fields city and sale figure. the search operation shold work with an efficiency of 0 (log n).
Posted
Comments
Richard C Bishop 21-Nov-12 10:12am    
Not a question. You need to provide code that you have tried and ask a specific question in regards to where you are having trouble.
boyliberal2007 21-Nov-12 10:24am    
I don't known about this problem? please help me
[no name] 21-Nov-12 10:37am    
You need to create a hash for the table if you want that kind of performance
lewax00 21-Nov-12 12:52pm    
Or a binary search. (Assuming it is sorted or can be sorted without impacting the requirements, of course.)
[no name] 21-Nov-12 13:43pm    
Yep, one you group them with a hash or some sort of indexing you can get a seacrh similar to log(x)

Having thought about it, start here[^].
 
Share this answer
 
Hi
you must supply more detail in order to get a good solution to your problem.
from your post i understand that you ar using a text file as database
text file cant replace a DB (from a preformancepoint of view), in oredr to solve this problem you can load all the data into Dictionary and query the dictionary for the data
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900