View Problem
Greatest Common Divisor
Find the largest positive integer that divides two given numbers without a remainder. For example, the GCD of 8 and 12 is 4.
groovy
Submit a new solution for groovy
There are 16 other solutions in additional languages (clojure, cpp, csharp, erlang ...)
static def gcd(int i, int j) {
if (Math.min(i,j)==0) return Math.max(i,j)
else return gcd(Math.min(i,j),Math.abs(i-j))
}
if (Math.min(i,j)==0) return Math.max(i,j)
else return gcd(Math.min(i,j),Math.abs(i-j))
}
Submit a new solution for groovy
There are 16 other solutions in additional languages (clojure, cpp, csharp, erlang ...)
