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 vote212 views2 answers
Find prime number c++
C++
3 votes218 views1 answer
C++ program to reverse an array
C++
0 vote218 views1 answer
Flutter run specific device
C++
2 votes210 views1 answer
C++ endl
C++
0 vote189 views1 answer
Map update field elixir
C++
0 vote202 views1 answer
(1 & 1) in cpp
C++
0 vote203 views1 answer
How to change colour image to grey in opencv c++
C++
1 vote260 views1 answer
C++ return value of set insert
C++
2 votes178 views2 answers
Count bits c++
C++
0 vote225 views1 answer
How to convert int to std::string
C++