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 vote275 views1 answer
Programs using vectors in c++
C++
5 votes268 views1 answer
Qt debug
C++
0 vote249 views1 answer
C++ to assembly
C++
0 vote272 views2 answers
Format c++ discord
C++
0 vote285 views1 answer
Google test assert exception
C++
0 vote264 views1 answer
Bash script add another user
C++
2 votes224 views1 answer
Java print f int
C++
0 vote280 views1 answer
C++ pointer to vector
C++
0 vote268 views1 answer
Print queue c++
C++
0 vote336 views1 answer
Time_t c++ stack overflow
C++