/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 vote210 views1 answer
Idnefier cout in undefined
C++
0 vote219 views1 answer
Sum of first 100 natural numbers
C++
1 vote216 views1 answer
How to create a pair of double quotes in c++
C++
2 votes217 views2 answers
Copy array c++
C++
1 vote246 views1 answer
C++ 2d vector assign value
C++
0 vote219 views1 answer
String reverse iterator c++
C++
1 vote219 views1 answer
C++ initialize array 1 to n
C++
0 vote232 views1 answer
Compile c++ MPI Program
C++
1 vote231 views1 answer
Preorder
C++
0 vote231 views4 answers
How to modify 2d array in function c++
C++

Share