/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 vote246 views1 answer
Msg91 python
Python
0 vote219 views2 answers
How to use information from env variables in python
Python
1 vote248 views1 answer
Token_obtain_pair check email
Python
0 vote265 views2 answers
Convert mixed number string to float
Python
0 vote278 views2 answers
Python diccionario setdefault
Python
1 vote251 views1 answer
How to update a plot in tkinter\
Python
-1 vote232 views2 answers
How to play video in colab
Python
15 votes253 views4 answers
Check if float is integer python
Python
-2 votes267 views1 answer
Formatting time in python
Python
1 vote262 views1 answer
Django queryset multiple filters
Python

Share