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

12 votes150 views1 answer
How to sort in descending order c++
C++
1 vote139 views1 answer
For loop vector
C++
0 vote152 views1 answer
String reverse iterator c++
C++
0 vote146 views1 answer
C++ program for inflation rate of two numbers
C++
0 vote143 views1 answer
How to get window size sfml
C++
3 votes151 views1 answer
Library imported for stl
C++
1 vote112 views1 answer
How to set environment variable for c++
C++
0 vote149 views2 answers
C++ memory leak
C++
1 vote137 views1 answer
How to traverse a linked list in c++
C++
14 votes160 views5 answers
Find length of array c++
C++