Lecture 19 String Matching (1)

Today, we talked about how to find whether a string of length n has a substring of length m. We described an algorithm which runs in O(n) assuming that we can prepoccess the pattern.