thnks shashank....bt i hv used trie for building the dictionary......bt since d wrong words does nt hv a common prefix...so it is nt suitable for storing wrong words(worst case scenario is common)... so i need a ds tht wd make d search of wrong words faster.....nd v dont hv to scan d entire dictionary file again....if d word is nt found in collection of wrong words thn v hv to scan d entire dictionary file....
On Fri, May 27, 2011 at 1:07 PM, bittu <[email protected]> wrote: > @himnashu..Obvious Trie(Data Structure) is best in this case i will > suggest you to study Trie deeply & try it.. > > > if you need more clarification, let me know > > > Thanks > Shashank > > > -- > 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 Himanshu Kansal MCS-DU -- 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.
