/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

7 votes155 views1 answer
How to give column names in pandas when creating dataframe
Python
1 vote139 views1 answer
How to change opencv capture resolution
Python
0 vote151 views3 answers
A program that asks for the user's input of a list of numbers and sort it in reverse in python
Python
0 vote164 views1 answer
Ocaml returns the last element of a list
Python
7 votes189 views1 answer
From string to time python dataframe
Python
0 vote193 views1 answer
Selenium press tab python
Python
0 vote196 views1 answer
Gcp functions save BQ
Python
1 vote173 views1 answer
Create python file kali linux
Python
4 votes157 views2 answers
Python input comma separated values
Python
31 votes179 views3 answers
How to add one to the index of a list
Python

Share