Pattern searching is a common requirement when we do search for a string in notepad/word file/browser/database, Here we use pattern searching algorithms in C++ to search.
Here we find occurrences of one pattern in another bigger pattern. It can simply be done by travelling through the loop in O(n) but the KMP algorithm improves the solution to O(n) in the worst case. The algorithm preprocesses the string and forms lps array. It stores the length of a maximum matching proper prefix which is also a suffix. we use these values to check whether the next characters are matched or not. we compare text and pattern until a mismatch is found
Submitted by Podila Rithwik Teja (Rithwik2084)
Download packets of source code on Coders Packet