You are viewing a single comment's thread. Return to all comments →
My haskell solution:
gcd' :: Integral a => a -> a -> a gcd' n m | n == m = n gcd' n m = let r = mod x y in if r == 0 then y else gcd' r y where x = max n m y = min n m
Computing the GCD
You are viewing a single comment's thread. Return to all comments →
My haskell solution: