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 vote305 views1 answer
Converting a for loop to a while loop C++
C++
0 vote363 views1 answer
C++ void to avoid functions
C++
0 vote334 views1 answer
Escribir texto c++
C++
5 votes325 views1 answer
C++ chrono
C++
0 vote328 views2 answers
C++ program to find prime number using function
C++
-1 vote361 views1 answer
Combination sum iv leetcode
C++
3 votes338 views1 answer
Vectors in c++
C++
0 vote416 views1 answer
C++ if bool true
C++
0 vote372 views1 answer
Dream speedrun music free download mp3
C++
-1 vote352 views1 answer
Int to hexadecimal in c++
C++