/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

3 votes213 views1 answer
Puissance python
Python
0 vote220 views1 answer
Nlargest of each group
Python
-1 vote238 views1 answer
Print something after sec python
Python
1 vote251 views1 answer
Get most repeated instance in a queryset django
Python Django
0 vote187 views1 answer
Jupyter today date
Python
-1 vote201 views1 answer
Groupby
Python
0 vote207 views2 answers
Loading images as sprites in pygame
Python
2 votes217 views1 answer
Flask if statement
Python
1 vote216 views1 answer
Get all h1 beautifulsoup
Python
0 vote216 views1 answer
Access CSV Files in Google Colab
Python

Share