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 vote120 views1 answer
Generate random double c++
C++
0 vote109 views1 answer
How to scan array in c++
C++
3 votes122 views1 answer
Map declaration c++
C++
0 vote108 views1 answer
3. The method indexOf, part of the List interface, returns the index of the first occurrence of an object in a List. What does the following code fragment do?
C++
5 votes120 views6 answers
For loop in cpp
C++
1 vote119 views1 answer
Visual studio cpp compiler
C++
12 votes132 views4 answers
Sort function descending c++
C++
0 vote129 views1 answer
C++ if bool true
C++
0 vote200 views1 answer
Ind the number of digits of a given integer n .
C++
0 vote127 views1 answer
C++ meaning ::
C++