Implementation of Rabin-Karp string matching algorithm using Haskell

Author: Giorgi Berozashvili
Keywords: String matching, Haskell, Rabin-Karp
Annotation:

String matching is one of the most common problems in the field of algorithms and there are many methods to solve it. The Rabin-Karp algorithm is also one of them and it uses substring hashing instead of string comparisons. As the hash value for a large fragment is exceeded, some programming languages ​​may not fully implement it, but Haskell's advantage is an infinite number type that allows the algorithm to be perfectly represented.