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 vote118 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 vote125 views1 answer
Temporary file using MSFT API in cpp
C++
2 votes117 views2 answers
Slice a vector c++
C++
1 vote110 views1 answer
Penjanje
C++
0 vote128 views1 answer
Move letter position using c++ with input
C++
3 votes135 views2 answers
Infinity c++
C++
11 votes78 views2 answers
Get data type of variable c++
C++
0 vote116 views1 answer
Inheritance example in C plus plus
C++
1 vote142 views1 answer
Cpp map iterate over keys
C++
0 vote119 views1 answer
Display dot product of two Arrays.
C++