/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

8 votes180 views6 answers
Python int to binary
Python
0 vote184 views1 answer
Python set prcess name
Python
0 vote191 views1 answer
Import cv2 illegal instruction (core dumped)
Python
0 vote223 views1 answer
Import numpy as np import matplotlib.pyplot as plt index = 0 missClassifiedIndexes = [] for label, predit in zip(y_test, predictions): if label != predict: missClassifiedIndexes.append(index) index = +1
Python
3 votes186 views1 answer
Join two set in python
Python
-4 votes177 views5 answers
Python 3.6 release date
Python
0 vote184 views1 answer
If not working
Python
0 vote206 views1 answer
Add favicon in django admin
Python
1 vote197 views2 answers
Extract numbers from list of strings python using regex
Python
3 votes180 views2 answers
Python get utc time
Python

Share