Created
April 18, 2015 06:34
-
-
Save jamesdavidson/8fe910dbad3cf00b785b to your computer and use it in GitHub Desktop.
Euclid's algorithm
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| -- Euclid's algorithm for calculating the greatest-common-divisor. | |
| gcd :: Integer -> Integer -> Integer | |
| gcd x y = | |
| if r == 0 then y else (gcd y r) | |
| where r = (mod x y) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment