/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

1 vote238 views1 answer
Procfile flask
Python
0 vote259 views1 answer
Image resolution extracting python
Python
3 votes227 views1 answer
Discord python webhook
Python
2 votes228 views2 answers
Python random dictionary
Python
0 vote258 views1 answer
Divide a column value in pandas dataframe
Python
1 vote259 views2 answers
Tensor get value
Python
0 vote232 views2 answers
Python longest word in string
Python
92 votes239 views4 answers
Rename data columns pandas
Python
2 votes249 views3 answers
Pandas select by list of values in column
Python
0 vote259 views1 answer
@foreach 1 numper
Python

Share