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 vote359 views1 answer
C++ unittest in ros
C++
15 votes328 views4 answers
C++ vector
C++
0 vote347 views1 answer
Size of set c++
C++
0 vote347 views1 answer
Accpt array input in single line in cpp
C++
0 vote348 views1 answer
Sort vector of pair c++
C++
1 vote366 views1 answer
Create n threads cpp
C++
-1 vote364 views1 answer
String array 2d c++
C++
0 vote387 views1 answer
Operator overloading outside class
C++
6 votes335 views9 answers
Preorder to postorder converter online
C++
0 vote353 views1 answer
Mt19937 example c++
C++