andreipetre
/ gcd.py
Created
February 11, 2014 20:23
Calculate the greatest common divisor for two positive integers
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 b > 0: | |
| a, b = b, a % b | |
| return a |