Hi,
I'm looking for the algorithm which does the lowest number of comparison for the string matching problem (in the worst case). I know that the complexity is liniar in the length of the strings, but I'm interested in finding the actual number of comparisons. The lowest number (theoretical) is m-n+1, but as far as I know no algorithm has achieved this limit. (where m is the lenght of the text and n is the length of the pattern). Thanks, Laura --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
