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

3 votes133 views1 answer
Create a dictionary cpp
C++
1 vote113 views1 answer
How to traverse a linked list in c++
C++
3 votes133 views1 answer
How i say hello world in c++
C++
0 vote142 views2 answers
C++ typeid
C++
0 vote121 views1 answer
How to make a c++ iostream program restart when finished
C++
1 vote165 views1 answer
Kwakiutl tribe artifacts
C++
0 vote128 views1 answer
\frac{2}{5}MR^2 typed in c++
C++
1 vote115 views1 answer
Pass c++
C++
0 vote137 views2 answers
C++ map key exists
C++
1 vote171 views1 answer
'std::ifstream file' has initializer but incomplete type
C++