欧几里德算法求最大公约数 - Ruby

gcd(m, n) = gcd(n, m mod n)

# author: jtusta
# contact: root@jtahstu.com
# site: http://www.jtahstu.com # software: RubyMine
# time: 2017/6/7 14:44
class Gcd
# 循环写法，即非递归写法
def gcd(m, n)
while n>0
m, n = n, m % n
end
return m
end

# 递归写法
def gcd_2(m,n)
return n==0?m:self.gcd_2(n,m%n)
end
end

c = Gcd.new

res = c.gcd(8,12)
puts res

rec = c.gcd_2(32,24)
p rec