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

3 votes108 views1 answer
Create a dictionary cpp
C++
11 votes108 views2 answers
C++ get ascii value of char
C++
2 votes95 views2 answers
C++ int to qstring
C++
0 vote90 views1 answer
Find Subarray sum using c++
C++
0 vote52 views1 answer
List that doesn't allow duplicates c++
C++
2 votes100 views2 answers
What s[i]-'0' does
C++
0 vote104 views1 answer
2d array of zeros c++
C++
8 votes101 views2 answers
‘setprecision’ was not declared in this scope
C++
2 votes100 views2 answers
C++ round number down
C++
1 vote94 views1 answer
Getline cin is being skipped
C++