/Python/Euclid algorithm

Euclid 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 algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

0 vote182 views1 answer
Keyboard input raspberry pi
Python
0 vote230 views1 answer
Return code error python
Python
0 vote225 views3 answers
Online kivy
Python
2 votes214 views2 answers
Bot ping discord.py
Python
0 vote225 views1 answer
Pandas split groupby
Python
3 votes222 views1 answer
How does scope work in python
Python
-1 vote213 views1 answer
Python __new__
Python
0 vote223 views1 answer
Pandas filter on range of values
Python
12 votes235 views6 answers
Python range function
Python
0 vote228 views1 answer
Unique file name in django
Python

Share