/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

0 vote151 views1 answer
How to store file into folder bucket aws
Python
3 votes167 views2 answers
Jupyter print full dataframe
Python
0 vote166 views1 answer
Quicksort in Python site:stackoverflow.com
Python
1 vote340 views1 answer
[0] * 10 python
Python
21 votes162 views6 answers
Select columns from dataframe pandas
Python
0 vote156 views2 answers
Python requests json backslash
Python
1 vote175 views2 answers
How to use screen in ubuntu
Python
0 vote153 views1 answer
Python read in integers separated by spaces
Python
5 votes164 views1 answer
How to count things in a list python
Python
1 vote146 views1 answer
Multidimensional Java Array
Python

Share