Lecture 11
The String Matching Problem¶
Overlapping
pass
The String Matching Algorithms¶
The naive string matching algorithm¶
Question
Consider the special case that each pair of char in pattern is different?
The Rabin-Karp algorithm¶
Note
Assume that \(\Sigma = \{0,1,\cdots 9\}\)