/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 vote282 views1 answer
C++ std map initializer list
C++
0 vote276 views7 answers
C code to mips assembly converter online
C++
9 votes305 views4 answers
Range based for loop c++
C++
0 vote281 views1 answer
Char size length c++
C++
0 vote285 views1 answer
Decising how many numbers after comma c++
C++
0 vote324 views2 answers
Iostream c++
C++
-1 vote283 views2 answers
Convert c++ to mips
C++
0 vote305 views1 answer
Auto keyword
C++
0 vote292 views1 answer
Rgb(100,100,100,0.5) validation c++
C++
1 vote266 views1 answer
C++ random number 0 to 1
C++

Share