/Python/Euclid's algorithm

Euclid's 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's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

2 votes226 views2 answers
Python check if internet is available
Python
2 votes252 views1 answer
Tan for python
Python
0 vote217 views2 answers
Save gif python
Python
0 vote204 views1 answer
Dockerize django app
Python
0 vote237 views1 answer
How to make a tuple
Python
-1 vote198 views1 answer
Ipywidgets pip
Python
0 vote220 views1 answer
Numpy move columns
Python
17 votes258 views4 answers
Substring in python
Python
0 vote170 views9 answers
Django.core.mail.backends.console.emailbackend
Python
1 vote270 views1 answer
Requirements.txt flask
Python

Share