Studying Fun

gcd.py

def gcd(a, b):
    if a < b:
        (a, b) = b, a
    print euclidean_algorithm(a, b)

def euclidean_algorithm(a, b):
    r = a % b
    if r:
        return euclidean_algorithm(b, r)
    return b

# Was studying for a final exam for number theory 
# and realized how simple this algorithm would be