/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 vote141 views1 answer
Xlabel font size python latex
Python
0 vote158 views1 answer
How to access app.config globally in flask app
Python
33 votes108 views3 answers
Python return if else one line
Python
15 votes151 views5 answers
Python http server
Python
0 vote141 views1 answer
Revit dynamo select all categories
Python
0 vote193 views1 answer
Pyspark rdd method
Python
0 vote147 views1 answer
How travel a list invertida in python
Python
0 vote144 views1 answer
Python 10-e10 numbers
Python
0 vote138 views1 answer
Nlp.Defaults.stop_words.add spacy
Python
0 vote147 views1 answer
Pytorch pad to square
Python

Share