Added shaker sort algorithm

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Abraham Hernandez (abraham@abranhe.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,46 @@
+<div align="center">
+	<img width="400" height="270" src="http://konpa.github.io/devicon/devicon.git/icons/cplusplus/cplusplus-original.svg" alt="C Plus Plus Logo">
+	<br>
+	<br>
+	<img src="https://cdn.abranhe.com/projects/algorithms/algorithms.svg" width="400px">
+  <br>
+	<br>
+  <p>All ▲lgorithms implemented in C Plus Plus</p>
+	<a href="https://algorithms.abranhe.com"><img src="https://img.shields.io/badge/All-%E2%96%B2llgorithms-700606.svg"></a>
+	<a href="https://github.com/abranhe/algorithms/blob/master/LICENSE"><img src="https://img.shields.io/github/license/abranhe/algorithms.svg" /></a>
+	<a href="https://cash.me/$abranhe"><img src="https://cdn.abraham.gq/badges/cash-me.svg"></a>
+	<a href="https://www.patreon.com/abranhe"><img src="https://cdn.abraham.gq/badges/patreon.svg" /></a>
+	<a href="https://paypal.me/abranhe/10"><img src="https://cdn.abraham.gq/badges/paypal.svg" /></a>
+	<br>
+	<br>
+	<a href="https://algorithms.abranhe.com"><code>algorithms.abranhe.com</code></a>
+</div>
+
+
+## Contents
+
+- [Arithmetic Analysis](arithmetic-analysis)
+- [File Transfer Protocol](file-transfer-protocol)
+- [Greedy Algorithms](greedy-algorithms)
+- [Graphs](graphs)
+- [Math](math)
+- [Neutral Network](neutral-network)
+- [Ciphers](ciphers)
+- [Data Structures](data-structures)
+- [Dynamic Programming](dynamic-programming)
+- [Hashes](hashes)
+- [Searches](searches)
+- [Sorting](sorting)
+- [Strings](https://github.com/AllAlgorithms/cpp/tree/master/Strings)
+- [Traversals](traversals)
+
+## License
+
+This work is licensed under a [MIT License](https://github.com/abranhe/algorithms/blob/master/LICENSE)
+
+[![MIT IMG][mit-license]]((https://github.com/abranhe/algorithms/blob/master/LICENSE))
+
+To the extent possible under law, [Carlos Abraham](https://go.abranhe.com/github) has waived all copyright and related or neighboring rights to this work.
+
+
+[mit-license]: https://cdn.abraham.gq/projects/algorithms/mit-license.png

Strings/Rabin_carp_algo.cpp

@@ -0,0 +1,117 @@
+    /*
+
+     * C++ Program to Implement Rabin-Karp Algorithm
+
+     */
+
+    #include <iostream>
+
+    #include <cstdio>
+
+    #include <cstring>
+
+    #include <cstdlib>
+
+    using namespace std;
+
+    #define d 256
+
+    /*
+
+     * search a substring in a string
+
+     */
+
+    void search(char *pat, char *txt, int q)
+
+    {
+
+        int M = strlen(pat);
+
+        int N = strlen(txt);
+
+        int i, j;
+
+        int p = 0;
+
+        int t = 0;
+
+        int h = 1;
+
+        for (i = 0; i < M - 1; i++)
+
+            h = (h * d) % q;
+
+        for (i = 0; i < M; i++)
+
+        {
+
+            p = (d *p + pat[i]) % q;
+
+            t = (d * t + txt[i]) % q;
+
+        }
+
+        for (i = 0; i <= N - M; i++)
+
+        {
+
+            if (p == t)
+
+            {
+
+                for (j = 0; j < M; j++)
+
+                {
+
+                    if (txt[i + j] != pat[j])
+
+                        break;
+
+                }
+
+                if (j == M)
+
+                {
+
+                    cout<<"Pattern found at index: "<<i<<endl;
+
+                }
+
+            }
+
+            if (i < N - M)
+
+            {
+
+                t = (d * (t - txt[i] * h) + txt[i + M]) % q;
+
+                if (t < 0)
+
+                  t = (t + q);
+
+            }
+
+        }
+
+    }
+
+
+
+    /* Main */
+
+    int main()
+
+    {
+
+        char *txt = "This is a sample Testcase";
+
+        char *pat = "sam";
+
+        int q = 101;
+
+        search(pat, txt, q);
+
+        return 0;
+
+    }

Strings/z algo.cpp

@@ -0,0 +1,115 @@
+    /*
+
+     * C++ Program to Implement Z-Algorithm
+
+     */
+
+    #include <iostream>
+
+    #include <cstring>
+
+    #include <vector>
+
+    using namespace std;
+
+    bool zAlgorithm(string pattern, string target)
+
+    {
+
+        string s = pattern + '$' + target;
+
+        int n = s.length();
+
+        vector<int> z(n, 0);
+
+        int goal = pattern.length();
+
+        int r = 0, l = 0, i;
+
+        for (int k = 1;  k < n; k++)
+
+        {
+
+            if (k > r)
+
+            {
+
+                for (i = k; i < n && s[i] == s[i - k]; i++);
+
+                if (i > k)
+
+                {
+
+                    z[k] = i - k;
+
+                    l = k;
+
+                    r = i - 1;
+
+                }
+
+            }
+
+            else
+
+            {
+
+                int kt = k - l, b = r - k + 1;
+
+                if (z[kt] > b)
+
+                {
+
+                    for (i = r + 1; i < n && s[i] == s[i - k]; i++);
+
+                    z[k] = i - k;
+
+                    l = k;
+
+                    r = i - 1;
+
+                }
+
+            }
+
+            if (z[k] == goal)
+
+                return true;
+
+        }
+
+        return false;
+
+    }
+
+
+
+    int main()
+
+    {
+
+        string tar = "This is a sample Testcase";
+
+        string pat = "case";
+
+        if (zAlgorithm(pat, tar))
+
+            cout<<"'"<<pat<<"' found in string '"<<tar<<"'"<<endl;
+
+        else
+
+            cout<<"'"<<pat<<"' not found in string '"<<tar<<"'"<<endl;
+
+        pat = "Kavya";
+
+        if (zAlgorithm(pat, tar))
+
+            cout<<"'"<<pat<<"' found in string '"<<tar<<"'"<<endl;
+
+        else
+
+            cout<<"'"<<pat<<"' not found in string '"<<tar<<"'"<<endl;
+
+        return 0;
+
+    }

dynamic-programming/coin_change.cpp

@@ -0,0 +1,41 @@
+#include<iostream> 
+
+using namespace std;
+
+int count( int S[], int m, int n ) 
+{ 
+    int i, j, x, y; 
+
+    // We need n+1 rows as the table is constructed  
+    // in bottom up manner using the base case 0 
+    // value case (n = 0) 
+    int table[n+1][m];
+
+    // Fill the enteries for 0 value case (n = 0) 
+    for (i=0; i<m; i++) 
+        table[0][i] = 1; 
+
+    // Fill rest of the table entries in bottom  
+    // up manner   
+    for (i = 1; i < n+1; i++) 
+    { 
+        for (j = 0; j < m; j++) 
+        { 
+            // Count of solutions including S[j] 
+            x = (i-S[j] >= 0)? table[i - S[j]][j]: 0; 
+            // Count of solutions excluding S[j] 
+            y = (j >= 1)? table[i][j-1]: 0;
+            table[i][j] = x + y; 
+        } 
+    } 
+    return table[n][m-1]; 
+} 
+
+int main() 
+{ 
+    int coins[] = {1, 2, 3}; 
+    int m = sizeof(coins)/sizeof(int); 
+    int n = 5;
+    cout << count(coins, m, n); 
+    return 0;
+}