/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 vote210 views4 answers
Download python turtle
Python
2 votes203 views3 answers
Torch.stack example
Python
0 vote226 views1 answer
Why wont my python input accept string inputs
Python
26 votes212 views6 answers
Sort list of dictionaries python
Python
1 vote213 views1 answer
Python numpy array delete multiple columns
Python
17 votes225 views4 answers
How to install python 3.6 ubuntu
Python
0 vote225 views1 answer
Gauss elimination python numpy
Python
1 vote201 views2 answers
Django class based views
Python Django
1 vote182 views2 answers
Python copy variable
Python
0 vote213 views1 answer
Python crop string
Python

Share