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 vote279 views1 answer
New expression
C++
1 vote274 views1 answer
How to print fixed places after decimal point in c++
C++
8 votes261 views1 answer
How to print every element of the array in cpp
C++
6 votes320 views1 answer
Convert string to stream c++
C++
0 vote318 views1 answer
How to scan vector in c++
C++
14 votes280 views5 answers
Find length of array c++
C++
2 votes309 views3 answers
Linear search
C++
0 vote301 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
1 vote296 views1 answer
C++ std string to float
C++
0 vote317 views1 answer
Store arbitrarly large vector of doubles c++
C++