/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 vote247 views1 answer
Python3 delete file
Python
0 vote300 views2 answers
How to kill python process started by excel
Python
0 vote338 views1 answer
Create django model field based on another field
Python
1 vote323 views1 answer
How to search where a character is in an array in python
Python
0 vote315 views1 answer
Python declare immutable variable
Python
2 votes331 views2 answers
Commands.has_role discord.py
Python
3 votes350 views3 answers
Python thread with parameters
Python
0 vote317 views1 answer
Ipywidgets unobserve functools partial
Python
0 vote336 views1 answer
Combine 3 jupyter cells together
Python
-1 vote330 views2 answers
Find common values in different dataframes pandas
Python

Share