/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

1 vote354 views1 answer
Start with pure c++ and opengl gamedev
C++
-3 votes414 views2 answers
Virtual function in C++
C++
12 votes341 views2 answers
Copy constructor c++ syntax
C++
7 votes358 views2 answers
Qt int to string
C++
0 vote344 views1 answer
Sort vector of pair c++
C++
10 votes313 views2 answers
Last index of string c++
C++
0 vote388 views1 answer
How to use power in c++
C++
4 votes342 views4 answers
Get list of files in directory c++
C++
1 vote361 views1 answer
Array sum in c++ stl
C++
105 votes479 views6 answers
C++ int to string
C++

Share