/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

7 votes207 views4 answers
Create dict from two columns pandas
Python
0 vote203 views1 answer
Aes in django
Python Django
1 vote196 views1 answer
Jupyter no output cell
Python
7 votes191 views3 answers
Sum of a numpy array
Python
0 vote205 views1 answer
Python select columns names from dataframe
Python
46 votes211 views6 answers
Comment in python
Python
0 vote202 views1 answer
Get return value of contract call in brownie
Python
13 votes212 views3 answers
Pandas set a value in colmns as the maximum value
Python
0 vote214 views1 answer
F-string print
Python
0 vote182 views2 answers
Python get webpage source
Python

Share