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 vote323 views1 answer
C++ get string between two characters
C++
0 vote362 views4 answers
Define for loop c++
C++
0 vote317 views1 answer
C++ read_ascii
C++
0 vote331 views1 answer
First and last digit of a number in c++
C++
3 votes373 views2 answers
How to get last element of set
C++
0 vote353 views1 answer
C++ write string
C++
189 votes517 views10 answers
New Year's Eve
C++
0 vote329 views1 answer
How to turn an integer variable into a char c++
C++
0 vote352 views3 answers
How to make loop in c++
C++
0 vote335 views1 answer
Cout hex c++
C++