/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

2 votes224 views1 answer
How to add headings to data in pandas
Python
5 votes235 views3 answers
Opencv python shrink image
Python
0 vote230 views1 answer
MULTIPLE Model Search in Django rest framework
Python
1 vote222 views1 answer
Using the Python string below to perform a search using a regular expression that you create. search_string=’’’This is a string to search for a regular expression like regular expression or regular-expression or regular:expression o
Python
7 votes216 views5 answers
Install discord python
Python
12 votes220 views2 answers
How to read input from stdin in python
Python
1 vote663 views1 answer
Python seaborn violin plot fit data better
Python
3 votes204 views1 answer
Count occurrences of value in array python
Python
28 votes179 views2 answers
Np zeroes
Python
0 vote234 views1 answer
Save python pptx in colab
Python

Share