Brute-Force

Naive algorithm for the string matching problem. It works in $O(nm)$-time

Appeared in:

• [31]: Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (3. ed.). MIT Press (2009), http://mitpress.mit.edu/books/introduction-algorithms ↗