/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 vote276 views1 answer
Repeat printing rows excel using python whenever i run the script
Python
1 vote260 views1 answer
Python test if list of dicts has key
Python
1 vote281 views1 answer
How to make a blank window open up in python
Python
1 vote270 views1 answer
Py how to deactivate venv
Python
0 vote275 views1 answer
Compute Jordan normal form of matrix in Python / NumPy
Python
1 vote281 views2 answers
Np one hot encoding
Python
0 vote272 views1 answer
Import baseestimator
Python
0 vote271 views1 answer
Find the Runner Up Score solution in python3
Python
2 votes260 views2 answers
Python convert datetime to float
Python
18 votes323 views3 answers
Python ascii code to string
Python

Share