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

2 votes254 views1 answer
Java print f int
C++
0 vote305 views1 answer
Lcm function c++
C++
-1 vote273 views3 answers
Convert c code to c++
C++
1 vote307 views1 answer
Splice string in c++
C++
-3 votes271 views1 answer
Cpp code for array sorting
C++
0 vote298 views1 answer
Use of undeclared identifier '_O_U16TEXT'
C++
0 vote323 views10 answers
Loop
C++
0 vote286 views1 answer
C++ shift array to the right
C++
4 votes329 views1 answer
C++ measure time of function
C++
0 vote329 views1 answer
Fast input and output c++
C++