Merge pull request #2 from dev-priyanshu15/dev-priyanshu15-patch-2

Create Knuth-Morris-Pratt (KMP) Algorithm for Pattern Searching

Author: dev-priyanshu15

search/Knuth-Morris-Pratt (KMP) Algorithm for Pattern Searching

@@ -0,0 +1,57 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+vector<int> computeLPSArray(string& pattern) {
+    int m = pattern.size();
+    vector<int> lps(m);
+    int len = 0;
+    int i = 1;
+
+    while (i < m) {
+        if (pattern[i] == pattern[len]) {
+            len++;
+            lps[i] = len;
+            i++;
+        } else {
+            if (len != 0) {
+                len = lps[len - 1];
+            } else {
+                lps[i] = 0;
+                i++;
+            }
+        }
+    }
+    return lps;
+}
+
+void KMP(string& text, string& pattern) {
+    int n = text.size();
+    int m = pattern.size();
+    vector<int> lps = computeLPSArray(pattern);
+    int i = 0, j = 0;
+
+    while (i < n) {
+        if (pattern[j] == text[i]) {
+            i++;
+            j++;
+        }
+
+        if (j == m) {
+            cout << "Pattern found at index " << i - j << endl;
+            j = lps[j - 1];
+        } else if (i < n && pattern[j] != text[i]) {
+            if (j != 0) {
+                j = lps[j - 1];
+            } else {
+                i++;
+            }
+        }
+    }
+}
+
+int main() {
+    string text = "ababcabcabababd";
+    string pattern = "ababd";
+    KMP(text, pattern);
+    return 0;
+}