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 vote183 views1 answer
Cpp pointer to two dimensional array
C++
0 vote189 views1 answer
Ascii allowed in c++
C++
0 vote185 views1 answer
Variadic template constructor matches better than copy constructor
C++
0 vote176 views1 answer
The five most significant revisions of the C++ standard are C++98 (1998), C++03 (2003) and C++11 (2011), C++14 (2014) and C++17 (2017)
C++
0 vote172 views1 answer
C++ convert template function to normal function
C++
0 vote153 views1 answer
Insertion overloading in c++
C++
0 vote194 views1 answer
Print linked list reverse order in c++
C++
1 vote161 views1 answer
Iff arduino
C++
0 vote168 views1 answer
Glm has no member value_ptr
C++
0 vote164 views1 answer
Cicli informatica c++
C++