/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

5 votes198 views2 answers
Convert every element in list to string python
Python
42 votes187 views4 answers
Pickle.dump python
Python
-2 votes185 views1 answer
How To Download Panda3D
Python
0 vote185 views1 answer
How to set default value in many2one
Python
1 vote185 views1 answer
Animate time series python
Python
0 vote187 views1 answer
Add field placeholder layout crispy modelform
Python
0 vote147 views1 answer
Django templates directory
Python
0 vote183 views2 answers
Python find index of closest value in list
Python
-2 votes185 views1 answer
Node js print
Python
0 vote187 views1 answer
Increment dic with for loop
Python

Share