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 vote106 views2 answers
GCD(x, yz)
C++
0 vote104 views1 answer
Print octal number in c++
C++
104 votes234 views6 answers
Integer to string c++
C++
0 vote113 views1 answer
Std::set remove item
C++
29 votes183 views6 answers
How to convert string to int in c++
C++
0 vote106 views1 answer
C++ CHEAT SHEAT
C++
0 vote98 views1 answer
How to save system function output into a variable in c++
C++
1 vote110 views1 answer
C++ nested switch statements
C++
-1 vote96 views1 answer
Template function in class c++
C++
0 vote106 views1 answer
C++ write to file in directory
C++