Trie is better in terms of scalability and performance. With Hashtable there is a problem of rehashing when all buckets are full and rehashing takes O(N). Although it happens once in a blue moon. That can impact the performance in a production environment.
With trie you dont have that problem. Thanks, Immanuel On Sun, Jul 24, 2011 at 12:43 AM, hary rathor <harry.rat...@gmail.com>wrote: > no aditional data structure is required , if we search in directly on input > stream. > by using Boyer-Moore string search > algorithm<http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm>. > it take Ω(n/m) or O(n). > so we do it on the fly. > > Hash function has also some prolem in where target word are anagram of src > word. > > > -- > 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.
