Merge pull request #37 from ramonssarmento/master

Recursive euclidean algorithm

Author: powerexploit

recursive_euclidean_algorithm.py

@@ -0,0 +1,9 @@
+def gcd(a, b):
+	if b == 0:
+		return a
+	return gcd(b, a % b)
+
+
+a = 192
+b = 162
+print(gcd(a,b) == gcd(b,a), gcd(a,b))