/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

2 votes183 views1 answer
Not scientific notation python
Python
0 vote175 views1 answer
Spark write progress bar jupyter
Python
2 votes185 views1 answer
Remove comma from string python column
Python
5 votes185 views3 answers
Extract zip file python
Python
41 votes187 views4 answers
Python path filename
Python
222 votes308 views6 answers
Python random numbers
Python
0 vote171 views1 answer
How to python program
Python
9 votes160 views2 answers
Django import Q
Python
0 vote181 views1 answer
Pandas df.index.values
Python
1 vote179 views1 answer
Draw spiral in matplotlib
Python

Share