You are viewing a single comment's thread. Return to all comments →
gcd' n m | n == 1 = m | otherwise = gcd' ( min ( m mod n ) (n mod m) ) ( max ( m mod n ) (n mod m) )
mod
Haskell experts, Can I know why its failing ?
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 →
gcd' n m | n == 1 = m | otherwise = gcd' ( min ( m
mod
n ) (nmod
m) ) ( max ( mmod
n ) (nmod
m) )Haskell experts, Can I know why its failing ?