From fec946385c82aed5ae5e28b81949aad190fa5afb Mon Sep 17 00:00:00 2001
From: Abdurrezzak Efe <abdurrezak.efe@ug.bilkent.edu.tr>
Date: Thu, 9 Nov 2017 22:41:51 +0200
Subject: [PATCH] Add files via upload

---
 18.RabinKarp.cpp | 59 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 18.RabinKarp.cpp

diff --git a/18.RabinKarp.cpp b/18.RabinKarp.cpp
new file mode 100644
index 0000000..0ceb5a4
--- /dev/null
+++ b/18.RabinKarp.cpp
@@ -0,0 +1,59 @@
+/*
+ * This program searches for a pattern in a text using
+ * Rabin - Karp Algorithm
+ *
+ *      Coded by: Abdurrezak Efe
+ *
+ * */
+
+
+
+#include <iostream>
+#include <cmath>
+#include <vector>
+using namespace std;
+
+int prime = 7;
+int pattern_hash;
+vector<int> indexes;
+
+int hasher(string s)
+{
+    int result = 0;
+    for(int i=0;i<s.size();i++)
+        result += (s[i] - 'a' + 1)*pow(prime, s.size()-i-1);
+
+    return result;
+}
+
+void rabin_karp(string text, string pattern)
+{
+    int m = pattern.size();
+
+    int cur_hash = hasher(text.substr(0,m));
+
+    //cout << cur_hash << endl;
+
+    for(int i=0; i < text.size()-m+1; i++) //searching
+    {
+        if(cur_hash == pattern_hash)
+            if(text.substr(i,m) == pattern)
+                indexes.push_back(i);
+
+        cur_hash = prime*(cur_hash - (text[i]-'a'+1)*pow(prime, m-1))+(text[i+m]-'a'+1); //updating hash in O(1)
+    }
+}
+
+
+int main()
+{
+    string text, pattern;
+    cin >> text >> pattern;
+
+    pattern_hash = hasher(pattern);
+    rabin_karp(text, pattern);
+
+    for(int i=0;i<indexes.size();i++)
+        cout << indexes[i] << endl;
+
+}
\ No newline at end of file