/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 vote162 views1 answer
Merge namedtuple python
Python
1 vote205 views1 answer
Python random liste
Python
0 vote155 views1 answer
How to add textbox in pygame window
Python
7 votes192 views2 answers
Cmd check if python is installed
Python
0 vote153 views1 answer
Select non nan values python
Python
0 vote160 views1 answer
Selenium how to handle element not found python
Python
33 votes195 views5 answers
How to filter out all NaN values in pandas df
Python
1 vote169 views1 answer
Who wrote permission to dance
Python
-1 vote161 views1 answer
Sphinx themes
Python
0 vote179 views1 answer
Plus in python
Python

Share