/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 vote113 views1 answer
Python docx extract image
Python
0 vote122 views1 answer
Python Split list into chunks using itertools Method
Python
0 vote131 views2 answers
Python fork error
Python
-1 vote103 views2 answers
Python increment
Python
1 vote112 views1 answer
Characters python
Python
0 vote159 views1 answer
Networkx draw graph with weight
Python
0 vote108 views1 answer
How to write stuff in python
Python
0 vote117 views1 answer
Python developer salary
Python
1 vote104 views1 answer
Can list comprehenios contain else
Python
0 vote110 views1 answer
PyQT5 reset color
Python

Share