/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 vote270 views1 answer
Add legend to colorbar
Python
0 vote237 views1 answer
How to disconnect wifi using python
Python
26 votes246 views3 answers
Check if variable is empty python
Python
7 votes210 views1 answer
Python get current file name
Python
1 vote240 views1 answer
Cut part of video ffmpeg
Python
3 votes231 views1 answer
Flask upload
Python
0 vote255 views1 answer
Django include all columns admin show
Python Django
0 vote257 views1 answer
Basic get method in class based view django
Python Django
0 vote229 views1 answer
How to add illegal characters to paths python
Python
0 vote245 views1 answer
Tkinter convert Entry to string
Python

Share