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 vote255 views1 answer
10^18 data type in c++
C++
0 vote276 views1 answer
Grep xargs sed
C++
4 votes247 views2 answers
Finding the length of an array
C++
36 votes250 views3 answers
How to type hello world in c++
C++
0 vote235 views2 answers
Shortest path in unweighted graph bfs
C++
0 vote273 views1 answer
Inverse lerp c++
C++
2 votes220 views4 answers
Input 2d vector c++
C++
1 vote244 views2 answers
Rotate array cpp
C++
1 vote206 views1 answer
Name one example of a “decider” program that you regularly encounter in real life.
C++
0 vote242 views1 answer
Age in days in c++
C++