/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 vote119 views1 answer
Import matrix from excel to matlab
C++
0 vote117 views1 answer
C++ compile to exe
C++
2 votes125 views1 answer
Web scraping with cpp
C++
0 vote105 views1 answer
Full implementation of binary search tree in C++
C++
0 vote98 views1 answer
What is handling null terminated string in c++
C++
0 vote129 views1 answer
How to initialize 2d array with values c++
C++
0 vote138 views1 answer
Find a number in vector c++
C++
-1 vote106 views1 answer
Cast c++
C++
0 vote107 views1 answer
What type is this c++
C++
1 vote117 views1 answer
Qt label set text color
C++

Share