Lecture 13

Today’s topic: String Matching

  • The Rabin-Karp algorithm for fast string matching.

Slides

Reading Guide

  • Chapter 32 except sections 32.3 and 32.4 of CLRS3 or CLRS4.

What should I know by the end of this set of lecture?

  • How does Rabin-Karp work? What is the clever idea with hash-functions.
  • How does Rabin-Karp compare with brute force string matching?