/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

12 votes286 views6 answers
Python range function
Python
0 vote299 views1 answer
Get data from keyboard python
Python
30 votes268 views5 answers
Python random float
Python
0 vote276 views1 answer
Python terminate program after specific time
Python
2 votes297 views3 answers
Python find first occurrence in list
Python
0 vote286 views3 answers
How to install idle on ubuntu 20.04
Python
2 votes321 views1 answer
Skcikit learn decision tree
Python
2 votes280 views3 answers
0 1 1 2 3 5 in python
Python
0 vote279 views1 answer
Pandas 3d set camara cords
Python
1 vote268 views1 answer
Assert len(lex) < self.bucket_specs[-1][1]
Python

Share