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

1 vote236 views1 answer
How to run a c++ program in the background
C++
0 vote233 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
0 vote253 views1 answer
Pointer address to string
C++
2 votes238 views1 answer
Cin.tie c++
C++
1 vote203 views1 answer
Qt can't use ^ operator on qchar
C++
2 votes260 views2 answers
How to get cursor position c++
C++
0 vote253 views1 answer
C++ define constant in class header
C++
5 votes242 views2 answers
Sleep c++ windows
C++
0 vote325 views1 answer
Void setup() { // put your setup code here, to run once:in m}void loop() { // put your main code here, to run repeatedly:}
C++
-2 votes245 views1 answer
Computer vision libraries C++
C++