[algogeeks] suitable data structure

2011-05-26 Thread himanshu kansal
if a large no of documents are available and need to find out the spelling errors.for this the words are compared wd a dictionary fileif a word is nt present in dictionary thn it is sure dt d word is wrong...thn v hv to print d no of occurences of the wrong wordassuming dt d word vl

Re: [algogeeks] suitable data structure

2011-05-26 Thread Vipul Kumar
Map , key will be the wrong wrd , so lookup will be O(1). On Thu, May 26, 2011 at 10:07 PM, himanshu kansal himanshukansal...@gmail.com wrote: if a large no of documents are available and need to find out the spelling errors.for this the words are compared wd a dictionary fileif a word