/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 vote146 views1 answer
Save a seaborn heatmap
Python
11 votes151 views4 answers
Pd.merge left join
Python
0 vote152 views1 answer
Sort eigenvalues and eigenvectors python
Python
0 vote151 views1 answer
Aiml python install
Python
2 votes179 views2 answers
Background image in python
Python
0 vote170 views1 answer
Geopandas españa map
Python
1 vote144 views1 answer
Import scipy python
Python
1 vote151 views2 answers
Pedagogical example
Python
6 votes151 views1 answer
Python in godot
Python
0 vote148 views1 answer
How many perfect squared lie between 1 and 400
Python

Share