/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 vote296 views1 answer
Insert missing data in pandas
Python
2 votes297 views1 answer
Timestamp change python
Python
0 vote359 views1 answer
Django today date in template
Python Django
85 votes288 views6 answers
How to activate virtual environment in python
Python
0 vote298 views1 answer
Add rectangle matplotlib
Python
1 vote290 views1 answer
Python - Comment chiffrer une boucle
Python
1 vote284 views1 answer
'set' object is not reversible
Python
1 vote309 views1 answer
How to get location of word in list in python
Python
8 votes285 views2 answers
How to print all combinations of a string in python
Python
0 vote284 views1 answer
Networkx node attribute from a dataframe
Python

Share