/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 vote179 views1 answer
Reduce dataframe merge
Python
0 vote180 views1 answer
Use of OfficeApi
Python
0 vote174 views4 answers
"%(class)s" in django
Python
15 votes193 views2 answers
Python from timestamp to string
Python
0 vote193 views1 answer
Return an RDD created by coalescing all elements within each partition into a list.
Python
0 vote171 views1 answer
Gfrequency listing in pandas
Python
1 vote185 views1 answer
Save video cv2
Python
2 votes166 views1 answer
Pandas index false print
Python
0 vote167 views1 answer
Pylatex tab
Python
0 vote182 views2 answers
Graph 3d python
Python

Share