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.
ruby 1.9.1
csharp
erlang
Submit a new solution for ruby, csharp, or erlang
There are 14 other solutions in additional languages (clojure, cpp, fantom, fsharp ...)
135.gcd(30)
# => 15
# => 15
public static int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
-module(gcd).
-export([gcd/2]).
gcd(A, 0) -> A;
gcd(A, B) -> gcd(B, A rem B).
-export([gcd/2]).
gcd(A, 0) -> A;
gcd(A, B) -> gcd(B, A rem B).
Submit a new solution for ruby, csharp, or erlang
There are 14 other solutions in additional languages (clojure, cpp, fantom, fsharp ...)
