/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 vote172 views1 answer
Python unknow number of arguments, default argument,
Python
1 vote156 views1 answer
Get value from TextCtrl wxpython
Python
0 vote168 views1 answer
Cache-control no cache django
Python
1 vote192 views1 answer
Set time complexity python
Python
0 vote191 views1 answer
Sort list in python by substring
Python
1 vote163 views1 answer
Cv2 add circle to image
Python
9 votes144 views2 answers
Make string numeric pandas
Python
3 votes157 views2 answers
Date object into date format python
Python
0 vote223 views1 answer
Decode in django templates
Python Django
0 vote167 views1 answer
Python get pixel
Python

Share