You are viewing a single comment's thread. Return to all comments →
my Haskell solution
gcd' :: Integral a => a -> a -> a gcd' n 0 = n gcd' n m = gcd m (n `mod` m)
Computing the GCD
You are viewing a single comment's thread. Return to all comments →
my Haskell solution