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 vote328 views1 answer
Add two constant char pointers c++
C++
0 vote329 views1 answer
C++ check if number is even or odd
C++
30 votes263 views10 answers
While loop c++
C++
1 vote293 views1 answer
Print linkedstack cpp
C++
0 vote308 views1 answer
C++ check if vector is sorted
C++
0 vote325 views1 answer
C++ cyclic barrier
C++
0 vote301 views1 answer
Phi function
C++
0 vote344 views1 answer
Cuda atomic swap
C++
1 vote315 views1 answer
Print all chrchetrs of a string c++
C++
2 votes318 views1 answer
How to create a structure c++
C++