thanks ankur khurana @dave May be u never did any mistake in posting and reading the problems. But dont think urself superior. Yeah i did mistake in reading the question so u must either ignore it or request me to not repeat it in future. You are behaving like its my daily routine of doing such kind of things.
On Thu, Aug 25, 2011 at 11:56 AM, Anup Ghatage <ghat...@gmail.com> wrote: > Actually, this method will be O(n) for any number of occurrences of a > single word, but It will go into O(n^2) for multiple occurrences of multiple > words. > > -- > 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. > -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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.
