/C++/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 vote351 views1 answer
123213
C++
0 vote353 views1 answer
C++ abs template
C++
2 votes320 views2 answers
C++ typedef array
C++
0 vote323 views1 answer
Uint16_t in c++
C++
4 votes331 views1 answer
Convert all characters in string to uppercase c++
C++
0 vote363 views1 answer
C++ typedef template class
C++
0 vote360 views1 answer
C++ random int troll
C++
19 votes335 views6 answers
Initialize 2D vector
C++
20 votes329 views2 answers
Find height of a tree
C++
0 vote344 views1 answer
Min element in stl c++
C++

Share