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 vote315 views1 answer
Servicenow cart api
C++
2 votes338 views5 answers
C++ loop through array
C++
2 votes280 views1 answer
First missing integer leetcode
C++
2 votes308 views1 answer
How to complie with c++ 17
C++
0 vote342 views1 answer
2d array of zeros c++
C++
0 vote300 views1 answer
Opencv c++ feature detection
C++
1 vote350 views1 answer
Qt design editor hide window bottom white bar
C++
0 vote320 views1 answer
Remove digit from number c++
C++
0 vote317 views1 answer
Which version c++ single file in sublime is
C++
0 vote321 views1 answer
Unpack tuple c++
C++