/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 vote181 views1 answer
When training= false still dropout
Python
11 votes203 views4 answers
Python remove empty values from list
Python
0 vote168 views10 answers
Python open file partially
Python
4 votes175 views2 answers
Pandas most frequent value
Python
0 vote173 views1 answer
Matlab .* operator in python
Python
0 vote175 views1 answer
Open url from ipywidgets
Python
0 vote234 views1 answer
Production mode flask
Python Flask
0 vote180 views3 answers
Python compiler to c++
Python
0 vote184 views1 answer
Qt platform plugin could not be initialized stackoverflow
Python
0 vote187 views1 answer
If object has property python
Python

Share