/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 vote135 views1 answer
Seaborn plot to see outliers
Python
6 votes128 views2 answers
Cp python
Python
0 vote92 views1 answer
How do I know which animation is playing animation player
Python
14 votes143 views5 answers
Python while continue
Python
7 votes176 views1 answer
Change value in pandas dataframe cell
Python
13 votes125 views6 answers
Range() python
Python
0 vote140 views1 answer
Python read binary trj file
Python
0 vote144 views1 answer
Sumif in python on a column and create new column
Python
65 votes148 views5 answers
Python version check in cmd
Python
2 votes179 views1 answer
Django EMAIL_BACKEND console
Python Django

Share