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 vote80 views1 answer
Prefix array algorithm in c++
C++
0 vote129 views1 answer
1162261467
C++
1 vote117 views1 answer
Perulangan c++
C++
5 votes118 views2 answers
Time measurement c++
C++
0 vote126 views1 answer
Sideways triangle c++ xy plane
C++
0 vote136 views1 answer
Sfml keyboard events cpp
C++
0 vote119 views1 answer
Uint16_t in c++
C++
2 votes128 views2 answers
What is typedef
C++
0 vote123 views1 answer
123213
C++
1 vote142 views1 answer
Flags for g++ compiler
C++