/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

75 votes185 views6 answers
Sort dictionary python
Python
5 votes187 views3 answers
Python pause function
Python
0 vote183 views1 answer
Convert_hex_to_ASCII_3.py
Python
7 votes192 views3 answers
Sklearn random forest regressor
Python
1 vote193 views1 answer
Draw spiral in matplotlib
Python
3 votes184 views2 answers
Requests post with headers python
Python
3 votes204 views1 answer
Pandas split by space
Python
0 vote196 views1 answer
If function has no argument python
Python
0 vote192 views2 answers
The find() method in BeautifulSoup ____.
Python
42 votes238 views6 answers
Python find directory of file
Python

Share