/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 vote281 views1 answer
What is thread in c++
C++
1 vote276 views1 answer
How to return char* from function in c++
C++
1 vote202 views1 answer
Can we create array inside an array in c++
C++
0 vote247 views1 answer
Finding no of unique characters in a string c++
C++
0 vote248 views1 answer
Setw in c++
C++
0 vote247 views1 answer
Taking integer input from file in c++
C++
-1 vote243 views1 answer
Assigning a seed on a random number generator in C++
C++
-1 vote257 views2 answers
Why is my unity crashing
C++
0 vote256 views1 answer
C++ declare binary number
C++
1 vote318 views1 answer
How to return 2d array from function c++
C++

Share