Rabin-Karp algorithm

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. For text of length n and p patterns of combined length m, its av

An implementation of the Rabin Karp Algorithm to find the longest common sub-sequence between to strings in C.