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 vote339 views1 answer
C++ encapsulation
C++
0 vote281 views1 answer
Compilling c++ and c by console
C++
-1 vote342 views1 answer
Ob for nginx.service failed because the control process exited with error code. See "systemctl status nginx.service" and "journalctl -xe" for details.
C++
0 vote312 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
1 vote298 views2 answers
Length of number c++
C++
0 vote289 views1 answer
Default rule of five c++
C++
1 vote318 views1 answer
How to print with the bool value in cpp
C++
0 vote306 views1 answer
Get input for array of unknown length/size in c++
C++
0 vote307 views3 answers
C++ variable type
C++
0 vote309 views1 answer
Ue4 float to fstring
C++