/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 vote255 views1 answer
Set iterator
C++
0 vote224 views1 answer
Qt make widget ignore mouse events
C++
12 votes278 views4 answers
How to initialized a 2d vector
C++
1 vote236 views1 answer
Optimized Bubble Sort
C++
0 vote278 views1 answer
Circular array
C++
-1 vote276 views2 answers
For c++
C++
0 vote272 views1 answer
Pimpl c++
C++
2 votes248 views1 answer
C++ print current time
C++
0 vote268 views1 answer
How to complie c++ to spesific name using terminal
C++
0 vote260 views1 answer
C++ filesystem read directory
C++

Share