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

5 votes130 views1 answer
Qdebug
C++
3 votes116 views2 answers
C++ find string in string
C++
0 vote140 views1 answer
1162261467
C++
0 vote149 views1 answer
C++ getline doesn't wait for input
C++
0 vote160 views1 answer
Sort strings by length and by alphabet
C++
0 vote124 views1 answer
Unreal engine c++ bind action to function with parameter
C++
0 vote128 views2 answers
Comment savoir si un nombre est premier c++
C++
4 votes121 views1 answer
C++ array vs vector
C++
2 votes164 views1 answer
What language is ethereum written in
C++
0 vote132 views1 answer
Intersection.cpp
C++