Skip to content

Instantly share code, notes, and snippets.

@cemdrk
Created December 22, 2018 17:34
Show Gist options
  • Save cemdrk/7ce97dc67795333763ecc156a4a856f1 to your computer and use it in GitHub Desktop.
Save cemdrk/7ce97dc67795333763ecc156a4a856f1 to your computer and use it in GitHub Desktop.
Euclid Greatest Common Divisor python implementation
def gcd(n, m):
while n:
n, m = m % n, n
return m
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment