You are viewing a single comment's thread. Return to all comments →
Haskell accumulator
gcd' :: Integral a => a -> a -> a gcd' 0 m = m gcd' m 0 = m gcd' n m = if m > n then gcd (n-m) m else gcd (m-n) n
Seems like cookies are disabled on this browser, please enable them to open this website
Computing the GCD
You are viewing a single comment's thread. Return to all comments →
Haskell accumulator