/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

1 vote161 views1 answer
Torch concat two 1d tensor
Python
2 votes156 views3 answers
How to do speed test with python
Python
0 vote165 views1 answer
Any and all in python3
Python
0 vote170 views1 answer
Python argparse type date
Python
2 votes185 views1 answer
Find all color in image python
Python
0 vote173 views1 answer
Get or create django
Python
58 votes178 views6 answers
Python Remove a character from a string
Python
8 votes170 views3 answers
Save plot in python
Python
-1 vote209 views2 answers
Django view
Python Django
1 vote171 views1 answer
Mean Kurtosis of all rows pandas
Python

Share