Create naive_pattern_matching.cpp

Given text string with length n and a pattern with length m, the task is to prints all occurrences of pattern in text.

Author: nitendra2211

strings/naive_pattern_matching.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+void search(string& pat, string& txt) {
+    int M = pat.size();
+    int N = txt.size();
+
+    // 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 pattern matches at index i
+        if (j == M) {
+            cout << "Pattern found at index " << i << endl;
+        }
+    }
+}
+
+// Driver's Code
+int main() {
+    // Example 1
+    string txt1 = "AABAACAADAABAABA";
+    string pat1 = "AABA";
+    cout << "Example 1: " << endl;
+    search(pat1, txt1);
+    
+    // Example 2
+    string txt2 = "agd";
+    string pat2 = "g";
+    cout << "\nExample 2: " << endl;
+    search(pat2, txt2);
+
+    return 0;
+}