Python fraction simplify

How to simplify fraction in python

def gcd(a,b):
	if a == 0:
		return b
	if b == 0:
		return a
	if a == b:
		return a
	if a > b:
		return gcd(a-b, b)
	return gcd(a, b-a)

def simplifyFraction(a, b):
  divisor = gcd(a, b)
  return (a / divisor, b / divisor)

Source: grepper.com

Python simplify fraction

#From scratch

#Euclid's algorithm https://en.wikipedia.org/wiki/Greatest_common_divisor#Euclid's_algorithm
def gcd(a: int, b: int):
    fraction = (a, b)
    while fraction[0] != fraction[1]:
        maximum = max(fraction)
        minimum = max(fraction)
        fraction = (maximum - minimum, minimum)
    return fraction[0]

def simplify(a: int, b: int):
  divisor = gcd(a, b)
  return (a / divisor, b / divisor)

-1

Source: grepper.com

Similar codes

0 vote219 views2 answers
Django render template
Python
1 vote208 views1 answer
Final class variable python
Python
1 vote241 views1 answer
Get most repeated instance in a queryset django
Python Django
0 vote190 views1 answer
Print only strings in list python
Python
6 votes190 views2 answers
Numpy ones
Python
0 vote252 views1 answer
Recall calculate confusion matrix .ravel()
Python
12 votes207 views2 answers
Python how to return max num index
Python
1 vote208 views3 answers
Django reverse lazy
Python Django
0 vote244 views2 answers
Mechanize python
Python
0 vote203 views1 answer
How to sort dataframe in python by length of groups
Python