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 vote166 views1 answer
Vprintf
C++
0 vote140 views1 answer
Flutter text direction auto
C++
1 vote149 views1 answer
Merge images opencv c++
C++
7 votes166 views3 answers
Setprecision in c++
C++
2 votes143 views1 answer
Arduino sprintf float
C++
2 votes155 views1 answer
C++ flush stdin
C++
2 votes152 views3 answers
Digit sum c++
C++
0 vote149 views1 answer
Get player pawn
C++
17 votes143 views2 answers
Convert string to char c++
C++
2 votes189 views1 answer
Switch case with string c++
C++