Kmp c++

void computeLPSArray(char* pat, int M, int* lps)
{
    int len = 0;
    lps[0] = 0;
    int i = 1;
    while (i < M) {
        if (pat[i] == pat[len]) {
            len++;
            lps[i] = len;
            i++;
        }
        else
        {
            if (len != 0) {
                len = lps[len - 1];
            }
            else
            {
                lps[i] = 0;
                i++;
            }
        }
    }
}
int matchFound=0;
void KMPSearch(char* pat, char* txt)
{
    matchFound=0;
    int M = strlen(pat);
    int N = strlen(txt);
    int lps[M];
    computeLPSArray(pat, M, lps);
    int i = 0;
    int j = 0;
    while (i < N) {
        if (pat[j] == txt[i]) {
            j++;
            i++;
        }
        if (j == M) {
            matchFound++;
//            printf("Found pattern at index %d ", i - j);
            j = lps[j - 1];
        }
        else if (i < N && pat[j] != txt[i]) {
            if (j != 0)
                j = lps[j - 1];
            else
                i = i + 1;
        }
    }
}

Similar codes

0 vote189 views1 answer
Recursive factorial of a number
C++
1 vote185 views1 answer
Prime numbers less than a given number c++
C++
0 vote199 views2 answers
C++ namespace
C++
0 vote187 views1 answer
Set iterator
C++
1 vote208 views1 answer
C++ encapsulation
C++
0 vote191 views1 answer
Syntax of member function in c++
C++
0 vote187 views1 answer
C++ classes
C++
3 votes215 views2 answers
Find maximum sum in array of contiguous subarrays
C++
0 vote165 views1 answer
User inptu in cpp
C++
0 vote168 views1 answer
How to store pair in min heap in c++
C++