Click here to Skip to main content
13,144,679 members (35,172 online)
Rate this:
 
Please Sign up or sign in to vote.
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 21-Nov-12 4:11am
Comments
richcb 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
Mathlab 21-Nov-12 10:37am
   
You need to create a hash for the table if you want that kind of performance
mark merrens 21-Nov-12 12:26pm
   
Patently a homework question: we don't do homework.
lewax00 21-Nov-12 12:52pm
   
Or a binary search. (Assuming it is sorted or can be sorted without impacting the requirements, of course.)
Mathlab 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)
Rate this: bad
 
good
Please Sign up or sign in to vote.

Solution 1

Having thought about it, start here[^].
  Permalink  
Rate this: bad
 
good
Please Sign up or sign in to vote.

Solution 2

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
  Permalink  

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

  Print Answers RSS
Top Experts
Last 24hrsThis month


Advertise | Privacy |
Web01 | 2.8.170915.1 | Last Updated 21 Nov 2012
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100