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 vote144 views1 answer
Traverse string in cpp
C++
0 vote234 views1 answer
Prisma client
C++
15 votes155 views4 answers
How to make a random number in c++
C++
0 vote146 views5 answers
Run time calculator c++
C++
9 votes170 views3 answers
Max function in c++
C++
0 vote172 views1 answer
Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum
C++
0 vote158 views1 answer
Youtube backlink generator tool
C++
5 votes139 views2 answers
C++ contains
C++
66 votes188 views8 answers
Dogecoin price
C++
0 vote166 views1 answer
KUNG FU HUSTLE
C++