FilesExpand file tree

 master

/

gcd.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (11 loc) · 314 Bytes

 master

/

gcd.py

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (11 loc) · 314 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

'''

Computes gcd of integers x,y using Euclid's Algorithm

'''

def gcd(x,y):

x = abs(x) #gcd(a,b) = gcd(|a|,b) = gcd(a,|b|) = gcd(|a|,|b|)

y = abs(y)

if x>y: # To ensure x<=y

x,y = y,x

if x==0:

return y

return gcd(y % x, x) # Euclid's algorithm