/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

0 vote77 views1 answer
Pip install --upgrade pip no module named pip
Python
0 vote140 views5 answers
Representation of multidimensional array in data structure
Python
1 vote140 views1 answer
Python convert number in array to integer
Python
0 vote125 views1 answer
Light fm cold start problem
Python
2 votes114 views1 answer
Filter a column in pandas by list of values
Python
0 vote150 views2 answers
Django-filter
Python
2 votes160 views2 answers
How to convert string to byte without encoding python
Python
0 vote122 views2 answers
[1, 2, 3]
Python
11 votes121 views3 answers
How to pause a python script
Python
0 vote128 views1 answer
Smtp django
Python

Share