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 vote135 views1 answer
C++ print 3d cube
C++
3 votes90 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
2 votes156 views2 answers
C++ length of char*
C++
-1 vote96 views1 answer
How to insert all values from one vector to another
C++
0 vote142 views1 answer
Prime factorisation of a number in c++
C++
1 vote143 views1 answer
Ifstream relative file path
C++
0 vote208 views1 answer
C++ add to array
C++
0 vote132 views1 answer
How to write a conclusion statement for an informative essay
C++
0 vote139 views1 answer
How to rotate canvas android
C++
0 vote139 views1 answer
C is widely used for systems-level software and embedded systems development.
C++