/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

57 votes243 views6 answers
Python environment
Python
0 vote310 views1 answer
Protobuf python
Python
1 vote236 views1 answer
Python get address of object
Python
6 votes222 views2 answers
Python gzip a file
Python
2 votes258 views6 answers
Online python pytorch free compiler
Python
0 vote229 views1 answer
Use a library in python
Python
3 votes238 views1 answer
Pythone csv
Python
-1 vote229 views1 answer
Python import from string
Python
1 vote239 views1 answer
Get all type of image in folder python
Python
1 vote256 views1 answer
Tkinter listbox delete all items
Python

Share