/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 vote322 views1 answer
Django cms create page programmatically
Python
2 votes298 views2 answers
Install curses python
Python
1 vote345 views6 answers
Code grepper
Python
1 vote342 views4 answers
Numpy count occurrences in array
Python
0 vote311 views3 answers
Lcm python
Python
10 votes319 views3 answers
Enter selenium in python
Python
28 votes362 views2 answers
Tofixed in python
Python
0 vote333 views1 answer
Python - Cara Bermain Mp3 File
Python
70 votes311 views6 answers
Get list of files in directory python
Python
0 vote340 views1 answer
Python tabulate print only one row
Python

Share