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 vote588 views1 answer
Cpp class access array member by different name
C++
0 vote166 views1 answer
Counting Sort C++
C++
1 vote165 views1 answer
Turn github into vscode
C++
1 vote152 views1 answer
Convert whole string to lowercase c++
C++
0 vote156 views1 answer
What algorithm does bitcoin use
C++
1 vote153 views1 answer
Qimage transformed
C++
-1 vote186 views1 answer
2927260.eps 2927262.jpg 2927263.ai License free.txt License premium.txt
C++
0 vote158 views1 answer
Transform cpp
C++
0 vote150 views1 answer
C++ shift array to the right
C++
0 vote171 views1 answer
#include <iostream> using namespace std; int main(){ int sum1 = 100+50; int sum2 = sum1+250; int sum3 = sum2+sum2; cout<< sum1 << "\n"; cout<< sum2 << "\n"; cout<< sum3 << "\n";
C++