Naive pattern matching algorithm

#include <bits/stdc++.h> 
using namespace std; 
  
void search(char* pat, char* txt) 
{ 
    int M = strlen(pat); 
    int N = strlen(txt); 
  
    /* A loop to slide pat[] one by one */
    for (int i = 0; i <= N - M; i++) { 
        int j; 
  
        /* For current index i, check for pattern match */
        for (j = 0; j < M; j++) 
            if (txt[i + j] != pat[j]) 
                break; 
  
        if (j == M) // if pat[0...M-1] = txt[i, i+1, ...i+M-1] 
            cout << "Pattern found at index "
                 << i << endl; 
    } 
}

Similar codes

0 vote214 views1 answer
Emplace vs push c++
C++
3 votes174 views1 answer
Loop over multidimensional array c++
C++
0 vote214 views1 answer
Rgb(100,100,100,0.5) validation c++
C++
0 vote203 views1 answer
Apply pca to dataframe
C++
1 vote275 views3 answers
Minimum characters to make string palindrome
C++
0 vote219 views1 answer
ALO
C++
0 vote226 views1 answer
Cmd color text c++
C++
1 vote210 views1 answer
Prime numbers less than a given number c++
C++
0 vote213 views1 answer
#defie in c++
C++
0 vote204 views2 answers
\0 in c++
C++