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

1 vote266 views1 answer
How to check is some number is divisible by 3 in c++
C++
12 votes265 views1 answer
Create copy constructor c++
C++
2 votes299 views1 answer
Hwo to calculate the number of digits using log in c++
C++
2 votes265 views2 answers
Run cmd command c++
C++
0 vote317 views1 answer
Backward chaining python
C++
0 vote306 views1 answer
Remove item from layout
C++
0 vote274 views1 answer
Currency Converter c++
C++
0 vote303 views1 answer
Print duplicate characters from string in c++
C++
2 votes276 views2 answers
Selection sort c++ algorithm
C++
1 vote273 views1 answer
Ue4 iterate tmap c++
C++