/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 vote185 views1 answer
How to join basename and directory in python os
Python
0 vote168 views1 answer
Python fft frequency spectrum
Python
0 vote225 views1 answer
Add to manytomany key django stackoverflow
Python Django
0 vote214 views1 answer
Python - Comment vérifier une corde est vide
Python
4 votes199 views4 answers
How to change django admin text
Python
0 vote231 views1 answer
Add image pptx python
Python
0 vote211 views1 answer
Sessions in flask
Python
1 vote205 views1 answer
Python pip install all dependencies
Python
0 vote187 views1 answer
Python dictionary get keys with condition on value
Python
1 vote252 views1 answer
Python seaborn heatmap decrease annot size
Python

Share