/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 vote141 views1 answer
Axes increase fonsize of values python
Python
0 vote143 views1 answer
Countvectorizer minimum frequency
Python
0 vote153 views1 answer
Convert string to integer in dictionary python
Python
5 votes150 views4 answers
Install python venv install
Python
0 vote147 views1 answer
Gpt2 simple continue training from checkpoint
Python
1 vote156 views1 answer
Set the root directory when starting jupyter notebooks
Python
1 vote176 views1 answer
Python /n
Python
0 vote155 views2 answers
Python:Gann square of 9
Python
19 votes137 views1 answer
Pygame scale image python
Python
1 vote137 views1 answer
Use incognito mode in selenium webdriver
Python

Share