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

1 vote103 views1 answer
Float in c++
C++
0 vote96 views1 answer
Sfml thread multi argument function
C++
0 vote99 views2 answers
How to create array with not constant size in cpp
C++
0 vote88 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
0 vote103 views1 answer
What does npl mean?
C++
1 vote99 views3 answers
On component begin overlap c++
C++
1 vote95 views1 answer
Abs in c++
C++
0 vote101 views1 answer
Jquery ajax post json asp.net core
C++
0 vote90 views1 answer
How can I replace a pattern from string in c++
C++
0 vote91 views1 answer
Convert GLFWwindow* to IntPtr
C++