/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 vote138 views1 answer
C++ print 3d cube
C++
0 vote141 views1 answer
C++ erase remove
C++
0 vote151 views2 answers
GCD(x, yz)
C++
0 vote146 views1 answer
Distructor of the node of the link list
C++
0 vote143 views1 answer
This is my p phone number in punjabi
C++
1 vote148 views1 answer
Print all chrchetrs of a string c++
C++
-1 vote139 views1 answer
Combination sum iv leetcode
C++
0 vote135 views10 answers
Convert python to c++ online
C++
3 votes145 views1 answer
Deque c++
C++
0 vote143 views1 answer
Intlen in c++
C++

Share