/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 vote131 views1 answer
How to clear multi dictionary in python
Python
0 vote82 views1 answer
Sql to python converter
Python
6 votes112 views2 answers
Python change working directory to file directory
Python
0 vote132 views3 answers
Python convert dat file to csv
Python
4 votes118 views3 answers
Iterate python
Python
0 vote121 views1 answer
Pip unknown command import
Python
0 vote125 views1 answer
Python keyboard hold key
Python
0 vote135 views2 answers
Python combine two lists into matrix
Python
33 votes126 views6 answers
Python array
Python
10 votes134 views4 answers
How to make a variable in python
Python

Share