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.
fsharp
erlang
Submit a new solution for fsharp or erlang
There are 15 other solutions in additional languages (clojure, cpp, csharp, fantom ...)
let rec gcd x y =
if y = 0 then x
else gcd y (x % y)
if y = 0 then x
else gcd y (x % y)
-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 fsharp or erlang
There are 15 other solutions in additional languages (clojure, cpp, csharp, fantom ...)
