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.
