/Python/Euclid algorithm

Euclid 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 algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

4 votes135 views1 answer
Set column datatype pandas
Python
5 votes131 views5 answers
Closure
Python
0 vote204 views1 answer
CACHE_TYPE flask
Python Flask
-1 vote136 views1 answer
Hello worldpython
Python
0 vote146 views1 answer
Check status code urllib open
Python
1 vote132 views1 answer
Argparse boolean default
Python
0 vote140 views1 answer
How to let only admins do a command in discord.py
Python
3 votes144 views6 answers
Django login
Python
8 votes150 views1 answer
Python CSV Has No Attribute 'Writer
Python
0 vote142 views2 answers
Doormat pattern python
Python

Share