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 vote256 views1 answer
Unknown amount of threads cpp
C++
4 votes267 views1 answer
Passing array to function c++ pointer
C++
3 votes251 views1 answer
How to convert qt string to string
C++
0 vote283 views6 answers
Template c++
C++
0 vote258 views1 answer
Platform io change baud rate
C++
2 votes250 views1 answer
Pointer dereference
C++
0 vote257 views1 answer
Ue4 foreach loop c++
C++
1 vote265 views1 answer
C++ multithreading
C++
0 vote288 views2 answers
If ERRORLEVEL
C++
1 vote279 views2 answers
Substring function in c++
C++