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

4 votes185 views2 answers
C++ initialize a vector
C++
0 vote188 views1 answer
Glm has no member value_ptr
C++
0 vote190 views2 answers
Function prototype c++
C++
0 vote200 views1 answer
C++ cout update percentage
C++
2 votes184 views3 answers
Vector with initial size
C++
0 vote174 views1 answer
Finding nth most rare element code in c++
C++
5 votes195 views5 answers
How to convert char to int in c++
C++
0 vote191 views1 answer
Emplace vs push c++
C++
20 votes171 views3 answers
C++ open file
C++
1 vote199 views2 answers
Maximum value in map in c++
C++