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
Enter the value of integer n. Print the figure as shown below.(3) Sample input 5 Sample output ***** **** *** ** *
C++
0 vote174 views1 answer
How To Calculate 1+1 in c++
C++
0 vote184 views1 answer
Size of set c++
C++
0 vote171 views3 answers
Iterator in c++
C++
34 votes147 views6 answers
C++ string to int
C++
1 vote205 views1 answer
How to block window resize sfml c++
C++
0 vote141 views1 answer
C++ starting syntaz
C++
1 vote145 views1 answer
C++ check if string contains non alphanumeric
C++
0 vote184 views1 answer
What c++ library is arccos in
C++
18 votes175 views5 answers
Clear console c++
C++