Advanced Search

Greatest common divisor (GCD) in Haskell

/ Published in: Other
Save to your folder(s)

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. gcd a 0 = a
  2. gcd a b = gcd b y
  3.   where y = mod a b

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.