gcd: func [
{Returns the greatest common denominator of m and n.}
m [integer!]
n [integer!]
][
;Euclid's algorithm
abs either zero? n [0] [either zero? (m // n) [n] [gcd n (m // n)]]
]
You need to create an account or log in to post comments to this site.