RosettaCodeData/Task/Greatest-common-divisor/Python/greatest-common-divisor-3.py

def gcd_iter(u, v):
    while v:
        u, v = v, u % v
    return abs(u)