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 file....if 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 word....assuming dt d word vl occur frquently in d file nd wd b wrong everytime....whch data structure wd b best suited for storing d wrong words....so tht v cn find whthr a wrd is wrong wdout scanning the dictionary....
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
