/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 votes260 views2 answers
Reciprocal python
Python
0 vote276 views1 answer
Finding the maximum element from a matrix with Python numpy.argmax()
Python
0 vote252 views1 answer
Save impt
Python
3 votes274 views3 answers
How to get median mode average of a python list
Python
0 vote283 views1 answer
Multiple variable declaration in python
Python
0 vote271 views1 answer
Python program to assess if a file is closed or not
Python
0 vote271 views1 answer
Docker remote
Python
1 vote257 views1 answer
How to set gui position tkinter python
Python
3 votes264 views2 answers
Postgres Database Django
Python Django
35 votes338 views6 answers
How to remove spaces in string in python
Python

Share