/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 vote280 views1 answer
Return object in python
Python
155 votes321 views6 answers
Python os if file exists
Python
10 votes279 views4 answers
How to append a dataframe to another dataframe in pandas
Python
18 votes257 views6 answers
Gui in python
Python
0 vote301 views1 answer
Get the invite url of server disc.py
Python
52 votes318 views6 answers
Sorting a dictionary in python
Python
0 vote266 views1 answer
Thicker lines in colorbar for contourplot
Python
6 votes286 views1 answer
How print ?
Python
2 votes204 views1 answer
EnvironmentError command line
Python
3 votes243 views2 answers
Python functional foreach
Python

Share