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

21 votes289 views3 answers
C++ access second last element of vector
C++
0 vote184 views1 answer
What is the system function in c++
C++
3 votes175 views1 answer
C++ check if string contains uppercase
C++
1 vote189 views2 answers
C++ code for selection sort
C++
1 vote181 views1 answer
System cpp
C++
2 votes184 views2 answers
C++ get cursor position console
C++
0 vote218 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
0 vote248 views1 answer
C++, for-loop over an array array
C++
0 vote185 views1 answer
Hamming c++
C++
0 vote186 views1 answer
Set iterator
C++