/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 vote208 views1 answer
Python node class
Python
1 vote433 views1 answer
Check datatype python
Python
8 votes198 views3 answers
Your account has reached its concurrent builds limit
Python
3 votes175 views2 answers
Enum
Python
0 vote188 views1 answer
Datetime day deutsch python
Python
1 vote132 views1 answer
Python turn non printable character to escape string
Python
-2 votes183 views1 answer
Django e docker
Python
1 vote174 views1 answer
Filter dict
Python
0 vote290 views1 answer
Python if column is null then
Python
13 votes197 views5 answers
Get index of item in list
Python

Share