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

7 votes224 views1 answer
Migration meaning
C++
1 vote219 views1 answer
GetCurrentThreadId c
C++
0 vote214 views1 answer
C++ convert int to double
C++
2 votes207 views1 answer
Print data type of a variable in c++
C++
2 votes176 views1 answer
First missing integer leetcode
C++
0 vote220 views1 answer
Currency Converter c++
C++
2 votes195 views3 answers
Selection sort cpp
C++
4 votes227 views1 answer
Passing array to function c++ pointer
C++
0 vote212 views1 answer
Zero fill in c++
C++
0 vote260 views1 answer
For statement in c++
C++