/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

1 vote327 views1 answer
How to open chrome console in selenium webdriver
Python
0 vote283 views2 answers
Allow x_frame_options django
Python
1 vote225 views1 answer
Python pandas row standard deviation
Python
0 vote288 views3 answers
Discord.py get channel name from id
Python
0 vote341 views1 answer
How to check if mouse is over a rect in pygame
Python
3 votes298 views1 answer
How to make a star in python turtle
Python
0 vote286 views2 answers
Grid list python
Python
0 vote269 views1 answer
Ipython list command history
Python
2 votes288 views1 answer
Calculate root mean square error python
Python
3 votes298 views2 answers
Python remove all occurrence of an items from list
Python

Share