/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 vote266 views1 answer
Import all images from folder python
Python
1 vote274 views1 answer
How to print a number at the end of a for loop in python
Python
0 vote247 views1 answer
Two legend left and right x asix matplotlib
Python
1 vote265 views1 answer
List arguments of function python
Python
0 vote279 views1 answer
ImportError: cannot import name 'MaskedArray' sklearn
Python
0 vote274 views1 answer
What does features = data.drop(["Survived", "Sex", "Embarked"], axis=1) do in python
Python
0 vote309 views1 answer
Suppress pandas future warnings
Python
17 votes261 views6 answers
Print function in python
Python
0 vote289 views1 answer
Max length of characters in dataframe's columns
Python
2 votes315 views1 answer
Python overwrite text that is already printed
Python

Share