advanced code snippet search
aflatter on 02/08/09
common Greatest haskell divisor gcd
1 person have marked this snippet as a favorite
gcd a 0 = agcd a b = gcd b y where y = mod a b
Report this snippet
(Note that this function is already defined in Prelude)
You need to login to post a comment.