/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

0 vote187 views1 answer
Why tensorflow not working in .py file
Python
0 vote194 views1 answer
Find maximum value by if else python
Python
0 vote199 views2 answers
Method get first last name python
Python
1 vote232 views1 answer
Difference between get and filter in django
Python Django
0 vote185 views1 answer
Python hello world jenkins
Python
80 votes146 views12 answers
Python3 if else
Python
0 vote174 views1 answer
Pivot table with lambda
Python
8 votes171 views2 answers
Syntaxerror: eol while scanning string literal
Python
0 vote182 views2 answers
Convert image to binary python
Python
0 vote203 views1 answer
How to chose right epoch
Python

Share