/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 vote223 views1 answer
Numpy randomly swap lines
Python
10 votes199 views4 answers
Opencv resize image
Python
0 vote277 views1 answer
Drop specific column in data
Python
0 vote197 views1 answer
How to insert files in tuple python
Python
2 votes193 views3 answers
How to convert hash to string in python
Python
0 vote225 views2 answers
PHP echo multiple lines example
Python
1 vote188 views1 answer
Python append several values
Python
7 votes166 views6 answers
Hello world in python
Python
0 vote196 views1 answer
Plt.suptitle position
Python
58 votes253 views6 answers
String list to int list python
Python

Share