euclidean_gcd: Add recursive euclidean

README.md

@@ -6,7 +6,7 @@ This repository contains examples of various algorithms written on different pro
 
 | Algorithm                                                                                       | C                                     | CPP                                   | Java                                  | Python                                |
 |:----------------------------------------------------------------------------------------------- |:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|
-| [Euclidean GCD](https://en.wikipedia.org/wiki/Euclidean_algorithm)                              |                                       |                                       |                                       | [:octocat:](Euclidean%20GCD/Python)   |
+| [Euclidean GCD](https://en.wikipedia.org/wiki/Euclidean_algorithm)                              |                                       |                                       |                                       | [:octocat:](euclidean_gcd/Python)     |
 
 
 ## Implemented Data Structures

euclidean_gcd/Python/euclidean_gcd.py

@@ -0,0 +1,36 @@
+def euclidean_gcd(first, second):
+    """
+    Calculates GCD of two numbers using the division-based Euclidean Algorithm
+    :param first:   First number
+    :param second:  Second number
+    """
+    while(second):
+        first, second = second, first % second
+    return first
+
+
+def euclidean_gcd_recursive(first, second):
+    """
+    Calculates GCD of two numbers using the recursive Euclidean Algorithm
+    :param first:   First number
+    :param second:  Second number
+    """
+    if not second:
+        return first
+    return euclidean_gcd_recursive(second, first % second)
+
+
+def main():
+    first, second = map(int, input('Enter 2 integers: ').split())
+    print('Division-based: GCD of {} and {} is: {}'.format(first,
+                                                           second,
+                                                           euclidean_gcd(
+                                                               first, second)))
+    print('Recursive: GCD of {} and {} is: {}'.format(first,
+                                                      second,
+                                                      euclidean_gcd_recursive(
+                                                          first, second)))
+
+
+if __name__ == '__main__':
+    main()