Knuth-Morris-Pratt (KMP)

Knuth-Morris-Pratt (KMP) is an Efficient String-Searching Algorithm Finding Occurrences of a "Pattern" within a "Text", Creating a Longest Proper Prefix Suffix (LPS) Array, which Intelligently Shifts the Pattern when a Mismatch Occurs