Use trie tree and store word count also along with the pointer. So, that search could take at max word size time.
On Sat, Jul 23, 2011 at 10:44 PM, rajeev bharshetty <[email protected]>wrote: > Trie data structure can be used ? What you say guys?? > > > On Sat, Jul 23, 2011 at 10:43 PM, ankit sambyal <[email protected]>wrote: > >> Use hashing with the words as key. Store the string of the word as the >> value.. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Regards > Rajeev N B <http://www.opensourcemania.co.cc> > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Varun Pahwa B.Tech (IT) 7th Sem. Indian Institute of Information Technology Allahabad. Ph : 09793899112 Official Email :: [email protected] Another Email :: [email protected] People who fail to plan are those who plan to fail. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
