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 vote100 views1 answer
Detect cycle in an undirected graph
C++
1 vote112 views1 answer
How to do sets in cpp
C++
0 vote120 views4 answers
Define for loop c++
C++
20 votes106 views5 answers
File c++
C++
0 vote125 views1 answer
How to format decimal palces in c++
C++
0 vote130 views1 answer
C++ switch integer
C++
10 votes63 views2 answers
Last index of string c++
C++
0 vote95 views3 answers
C++ variable type
C++
0 vote110 views1 answer
Find largest number in each row in array c++ using function
C++
2 votes100 views2 answers
Selection sort c++ algorithm
C++