faster iterative gcd to avoid max recursion error

Author: ofek

math/gcd.py

@@ -1,13 +1,10 @@
 '''
-Computes gcd of integers x,y using Euclid's Algorithm
+Computes gcd of integers a and b using Euclid's Algorithm
 '''
 
 
-def gcd(x,y):
-    x = abs(x)              #gcd(a,b) = gcd(|a|,b) = gcd(a,|b|) = gcd(|a|,|b|)
-    y = abs(y)
-    if x>y:                 # To ensure x<=y
-        x,y = y,x
-    if x==0:
-        return y
-    return gcd(y % x, x)    # Euclid's algorithm
+def gcd(a, b):
+    while True:
+        if b == 0:
+            return a
+        a, b = b, a % b