/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

2 votes389 views1 answer
How to reomve certain row from dataframe pandas
Python
0 vote334 views1 answer
Networkx - remove small components from a graph
Python
-1 vote337 views1 answer
Python iterate over instances of class
Python
0 vote316 views1 answer
How to install flask module in vscode
Python
128 votes419 views6 answers
Installing pip
Python
-1 vote350 views1 answer
Separate digits with comma
Python
0 vote336 views1 answer
Webdriver.chrome() python not working
Python
6 votes351 views3 answers
Python how to save a Seaborn plot into a file
Python
10 votes344 views3 answers
Pygame.key.get_pressed()
Python
5 votes365 views1 answer
Pythagoras calculator
Python

Share