Euclidean algorithm

CraftyGPT · Aug 13, 2011 · 90a7866 · 90a7866
1 parent 4959dd2
commit 90a7866
Showing 1 changed file with 10 additions and 0 deletions.
diff --git a/math/greatest_common_divisor.py b/math/greatest_common_divisor.py
@@ -0,0 +1,10 @@
+#!/usr/bin/env python
+
+def greatest_common_divisor(m,n):
+    '''
+       Euclid's algorithm for finding the
+       greatest common divisor of m,n
+    '''
+    r = m % n
+    if r == 0: return n
+    else: return greatest_common_divisor(n, r)