/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 vote109 views1 answer
Python tar a directory
Python
5 votes87 views1 answer
Fetch row where column is equal to a value pandas
Python
0 vote63 views1 answer
Run a python script with python and catch command line output
Python
0 vote96 views1 answer
Validate string using six library python
Python
1 vote100 views1 answer
Convert pandas dataframe to django queryset
Python
10 votes137 views6 answers
Formatting in python
Python
5 votes105 views1 answer
Generate a color python
Python
0 vote100 views2 answers
Generator expression
Python
6 votes97 views2 answers
Jupyter display all columns
Python
0 vote114 views1 answer
Python n range num list
Python

Share