> > I know that the complexity is liniar in the length of the strings, but > I'm interested in finding the actual number of comparisons. >
Knuth Morris Prat algorithm works using m+n steps i.e. one pass over the pattern and one pass over the string. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
