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 vote129 views1 answer
Constructor syntax in c++
C++
2 votes140 views3 answers
Digit sum c++
C++
1 vote134 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
1 vote145 views1 answer
Separation between paragraphs latex
C++
0 vote128 views1 answer
Binary search c++
C++
0 vote129 views1 answer
How to create a c++ templeate
C++
101 votes276 views6 answers
How to turn int into string c++
C++
0 vote145 views1 answer
Honeygain linux
C++
3 votes125 views5 answers
Combine two vectors c++
C++
0 vote141 views1 answer
How to choose struct's endianness cpp
C++