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 vote184 views1 answer
Arraylist equivalent cpp
C++
19 votes210 views1 answer
How to load from files C++
C++
3 votes196 views1 answer
Map declaration c++
C++
0 vote185 views1 answer
Is there garbage collection in c++
C++
1 vote156 views1 answer
Random number between x and y c++
C++
2 votes196 views2 answers
C++ get cursor position console
C++
2 votes191 views1 answer
Fatal error: opencv2/opencv.hpp: No such file or directory
C++
0 vote251 views1 answer
Thread c++ member function
C++
-1 vote229 views1 answer
C++ set console title
C++
2 votes198 views1 answer
Dlopen failed: library "libomp.so" not found
C++