/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

1 vote331 views1 answer
User group template tag django
Python
0 vote301 views1 answer
Separating tuple in pandas
Python
0 vote291 views1 answer
Pandas print dataframe dtypes
Python
19 votes287 views6 answers
Pop function in python
Python
0 vote295 views1 answer
How to make python turn a list into a text file grapper
Python
0 vote286 views1 answer
Custom attribute selenium
Python
-1 vote379 views1 answer
Convert this bash command into Python echo have a nice day Quizlet
Python
0 vote297 views2 answers
How to make SAPI.SpVoice say a variable in python
Python
0 vote296 views1 answer
Python get volume free space
Python
0 vote296 views1 answer
Dataproc initialization_actions error
Python

Share