/Python/Euclid algorithm

Euclid algorithm

Gcd algorithm

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)

2

Source: en.wikipedia.org

Euclid algorithm

int Euclid(int a, int b)
{
    int r;
    while(b != 0) 
    {
         r = a % b;
         a = b; 
         b = r; 
    }
    return a; 
}

1

Euclid algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

1 vote122 views1 answer
Animations text terminal python
Python
36 votes113 views2 answers
Python file open modes
Python
0 vote116 views1 answer
Python playsound stop
Python
0 vote128 views2 answers
Loop through groupby pandas
Python
4 votes154 views3 answers
Round down decimal python
Python
1 vote189 views2 answers
Django content type
Python Django
6 votes126 views3 answers
Selenium.common.exceptions.WebDriverException: Message: 'chromedriver' executable needs to be in PATH. Please see https://sites.google.com/a/chromium.org/chromedriver/home
Python
1 vote123 views1 answer
Django queryset average of unique values
Python
0 vote122 views1 answer
Matlab find 2d index
Python
2 votes120 views1 answer
Python set a specific datetime
Python

Share