/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 vote162 views1 answer
Python 1 to 01
Python
5 votes165 views1 answer
Python generate id
Python
0 vote201 views1 answer
How to know if i'm in a virtual environment
Python
0 vote159 views1 answer
Blank lines with csv.writer
Python
1 vote181 views1 answer
Pandas dataframe sum with condition
Python
0 vote220 views1 answer
Take substring of every element in dataframe
Python
2 votes171 views1 answer
Python pip graphviz
Python
5 votes172 views4 answers
Install python venv install
Python
17 votes203 views5 answers
Python add element to array
Python
1 vote222 views7 answers
LightGBM
Python

Share