KMP Algorithm (Searching for Patterns)

Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m.

Examples:

Input:  txt[] = "THIS IS A TEST TEXT"
       pat[] = "TEST"
Output: Pattern found at index 10

KMP Algorithm : https://www.geeksforgeeks.org/kmp-algorithm-for-pattern-searching/