/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 vote165 views1 answer
201903100110041
Python
0 vote163 views1 answer
Python Print Variable Using the String Formatting with the help of % character
Python
4 votes157 views3 answers
Python image crop
Python
8 votes152 views2 answers
How to detect mouse click in pygame
Python
1 vote147 views1 answer
How to print a list of strings in python
Python
1 vote162 views1 answer
Def speak("audio"):
Python
0 vote157 views2 answers
Pandas fast way to view distribution by group
Python
0 vote188 views1 answer
Seaborrn set figsize
Python
0 vote200 views1 answer
Calculate quartil python
Python
0 vote125 views3 answers
How to compare the two key from constant value to list of string in python
Python

Share