/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

29 votes357 views2 answers
Crispy forms
Python
1 vote301 views2 answers
Find all unique items in dictionary value python
Python
68 votes302 views6 answers
Python list files in directory
Python
0 vote343 views1 answer
What is require_self
Python
0 vote315 views1 answer
Bitbucket rest api python example
Python
0 vote305 views2 answers
Extra error
Python
0 vote335 views1 answer
Student notebook (finish), INB (finish), Food and Fitness log (log necessary), debate speech (finish)
Python
24 votes341 views6 answers
Pd.read_excel
Python
1 vote336 views1 answer
Python how to create attribute of class while iterating a list
Python
0 vote326 views1 answer
Python run things at certain datetimes
Python

Share