python 记录欧几里得算法

#保证a>b

def gcd(a,b):	
	if b==0:
		return a
	else:
		return gcd(b, a%b)

def gcd(a, b)
	if a<b:
		a,b = b,a
	else:
		while(b > 0):
			r = a%b
			a = b
			b = r
	return a