/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

7 votes266 views1 answer
How to make string get spaces c++
C++
1 vote273 views1 answer
Isalpha c++
C++
1 vote266 views1 answer
Controlling in windows
C++
0 vote295 views1 answer
C++ public inheritance not getting protected
C++
4 votes311 views2 answers
Input pdf latex
C++
0 vote272 views1 answer
Check whether K-th bit is set or not c++
C++
0 vote292 views1 answer
Temporary file using MSFT API in cpp
C++
0 vote288 views1 answer
Mpgh dbd
C++
4 votes273 views3 answers
C plus
C++
4 votes307 views1 answer
C++ measure time
C++

Share