/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

2 votes108 views1 answer
Python 3.7 tutorial pdf with exercises
Python
0 vote99 views1 answer
Union dataframe pyspark
Python
4 votes106 views1 answer
How to clear a command line python
Python
24 votes157 views5 answers
Get time python
Python
0 vote126 views3 answers
Pyinstaller add files
Python
0 vote110 views1 answer
Django change settings at runtime
Python
0 vote108 views1 answer
Comment a lot of lines python vscode
Python
2 votes101 views1 answer
Django group with permission
Python
1 vote54 views1 answer
Python xml update
Python
0 vote97 views1 answer
Countvectorizer remove stop words
Python

Share