Rabin-Karp algorithm

The Rabin-Karp algorithm focuses instead on speeding up lines 3-6.

The Rabin-Karp algorithm is a relatively fast string searching algorithm that works in O(n) time on average.

Rather than pursuing more sophisticated skipping, the Rabin-Karp algorithm seeks to speed up the testing of equality of the pattern to the substrings in the text by using a hash function.

In computer science, the Rabin-Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.