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 vote159 views1 answer
Implementing split function in c++
C++
0 vote193 views1 answer
C++ switch integer
C++
-1 vote171 views2 answers
Why is my unity crashing
C++
2 votes168 views1 answer
C++ custom compare in set
C++
2 votes192 views2 answers
Array and for loop in c++
C++
0 vote125 views1 answer
Interest rate parity
C++
0 vote168 views1 answer
Find subarray sum in c++
C++
0 vote211 views1 answer
Concatenate two vectors c++
C++
-1 vote163 views1 answer
A[12] = h + A[8]
C++
0 vote113 views1 answer
Prefix array algorithm in c++
C++