CODE EXAMPLE FOR PYTHON

euclidean algorithm recursive python

def gcd(a, b):
  return b if (a == 0) else gcd(b%a, a)
#contributed by rohit gupta