/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

2 votes200 views1 answer
How to create a loop in python turtle
Python
0 vote197 views1 answer
Ya mom
Python
5 votes255 views2 answers
Click button in selenium python
Python
-1 vote208 views1 answer
How split text in python by space or newline with regex
Python
0 vote216 views3 answers
When was python 3 released
Python
0 vote200 views1 answer
Class has no object members
Python
0 vote246 views1 answer
Django insert bulk data
Python Django
0 vote220 views1 answer
How to place an id to every element in list in python
Python
2 votes173 views1 answer
What is the difference between the use of iloc and loc?
Python
124 votes247 views6 answers
Python read json file
Python

Share