/Python/Euclid's algorithm

Euclid's 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's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

15 votes264 views2 answers
Random python between 0 and 1
Python
1 vote266 views1 answer
Insert row in any position pandas dataframe
Python
18 votes266 views4 answers
If __name__ == '__main__'
Python
18 votes257 views5 answers
Remove n from string python
Python
0 vote312 views1 answer
Form is undefined flask
Python Flask
1 vote204 views1 answer
Sciket learn imputer code
Python
4 votes237 views1 answer
Removing whitespaces from pandas dataframe csv
Python
0 vote293 views2 answers
Torch.cat
Python
15 votes247 views2 answers
If type is string python
Python
1 vote266 views1 answer
Search google images python
Python

Share