/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 vote484 views2 answers
Sum python
Python
0 vote209 views1 answer
Remove stopwords from list of strings python
Python
2 votes208 views1 answer
Alex john
Python
0 vote214 views1 answer
How to find empty rows of a dataset in python
Python
6 votes203 views1 answer
Python logo png
Python
3 votes183 views1 answer
How to use threading in pyqt5
Python
1 vote199 views1 answer
ANSHUL
Python
0 vote225 views1 answer
Django time cualtulate
Python Django
10 votes229 views10 answers
Python Program to capitalize a string
Python
22 votes200 views4 answers
Join two numpy arrays
Python

Share