Merge pull request #728 from swicaksono/master

Recursive algorithm

Author: probot-auto-merge[bot]

Recursive/gcd.py

@@ -0,0 +1,12 @@
+'''
+The GCD algorithm computes the greatest common divisor of two numbers A and B recursively.
+'''
+
+def gcd(x, y):
+    if (y==0):              # base case 
+        return x
+    else:                   # recursive case
+        return gcd(y, x%y)
+
+if __name__ == "__main__":
+    print (gcd(x=100, y=20))

Recursive/n_choose_k.py

@@ -0,0 +1,12 @@
+'''
+The N choose K algorithm computes the binomial coefficient C(N, K)
+'''
+
+def nchoosek(n, k):
+    if (k == 0) or (k == n):            # base case
+        return 1
+    else:                               # recursive case
+        return nchoosek(n-1, k-1) + nchoosek(n-1, k)
+
+if __name__ == "__main__":
+    print (nchoosek(n=5, k=3))