/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 vote315 views1 answer
Get the invite url of server disc.py
Python
5 votes274 views3 answers
Python add
Python
0 vote280 views2 answers
Python send image server
Python
0 vote295 views1 answer
Slayer_coins_spent
Python
0 vote286 views1 answer
Python break list into n lists
Python
0 vote284 views1 answer
Django active link
Python
0 vote318 views1 answer
Python csv row index is empty
Python
0 vote280 views1 answer
Medium how to interact with jupyter
Python
1 vote248 views1 answer
Split dict into chunks python
Python
-1 vote302 views1 answer
How to unstack multiindex pandas
Python

Share