String searching algorithm

String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.

The Knuth-Morris-Pratt string searching algorithm searches for occurrences of a "pattern" string $P$ within\; a\; main\; string$ S$ by\; employing\; the\; simple\; observation\; that\; when\; a\; mismatch\; occurs,\; ...$$$$