/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 vote117 views1 answer
Function overloading in c++
C++
0 vote124 views1 answer
Hz
C++
-1 vote131 views1 answer
C++ set console title
C++
1 vote133 views1 answer
Certificate exe application
C++
90 votes221 views5 answers
Tostring c++
C++
6 votes130 views2 answers
C++ create thread
C++
-1 vote131 views1 answer
Templates of templates c++
C++
5 votes109 views2 answers
Best way to take input in cpp
C++
1 vote126 views2 answers
How to find the size of a character array in c++
C++
14 votes107 views1 answer
Dynamically generating 2d array in cpp
C++

Share