Created
June 5, 2013 17:32
-
-
Save mbrenig/5715678 to your computer and use it in GitHub Desktop.
Euclid's greatest common divisor algorithm
This file contains 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
| def gcd(a,b): | |
| while a != 0: | |
| a, b = b % a, a | |
| return b | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment