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

22 votes199 views18 answers
Pointers in c++
C++
20 votes245 views3 answers
How to append to a vector c++
C++
0 vote233 views1 answer
C++ switch integer
C++
4 votes219 views3 answers
GCD in cpp
C++
45 votes213 views6 answers
Input in c++
C++
2 votes229 views1 answer
Qchar to char
C++
0 vote196 views1 answer
Flowchart to display factors of a number
C++
0 vote208 views1 answer
Cout.flush() in c++
C++
0 vote220 views3 answers
An array that take different data type c++
C++
2 votes211 views1 answer
Dangling Pointer in cpp
C++