greatest common divisor by euclid

euclid_gcd.lua

#!/usr/bin/env lua

euclid_gcd = {}

function euclid_gcd.var1(m, n)
	local r = 1
	while r ~= 0 do
		r = m % n
		m = n
		n = r
	end
	return m
end

function euclid_gcd.var2(m, n)
	while true do
		m = m % n
		if m == 0 then return n end
		n = n % m
		if n == 0 then return m end
	end
end

return euclid_gcd