I agree with the trie solution. But now how do you generalise it for K. I mean a word can be made from k other words.
On Wed, Jan 12, 2011 at 12:53 AM, juver++ <avpostni...@gmail.com> wrote: > If you represent dictionary as a hash table, lookup costs you O(L) at > least! > Cause you need to calculate hash for the string. But for the trie it is > O(L) in a worst case. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.
