/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

4 votes141 views2 answers
String count occurrences c++
C++
2 votes158 views1 answer
Suppress individual warnings in visual c++
C++
1 vote182 views1 answer
C++ char define
C++
2 votes152 views2 answers
Run cmd command c++
C++
0 vote158 views1 answer
Softwareegg.courses4u
C++
5 votes156 views2 answers
String c++ if letter is lowercase
C++
18 votes166 views4 answers
Array length c++
C++
0 vote170 views1 answer
Nodeafternode
C++
0 vote123 views2 answers
Vector to string c++
C++
18 votes164 views2 answers
Stl for sorting IN C++
C++

Share