for every word in the document , apply hash funtion.. store the string n its frequency too.. if we get the same word , then increment the frequency.
after storing. whenver we want to search the word , searching in O(1) time , jst applying hash function again on the word to be searched .. correct me if i am wrong? On Thu, Aug 25, 2011 at 7:14 PM, Shrey Choudhary <choudharyshre...@gmail.com > wrote: > how will we exactly implement hashtables in this? What will be > appropriate keys? ?? > > -- > 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. > > -- 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.
