/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 vote341 views2 answers
C++ random between two values
C++
0 vote324 views1 answer
Reverse string upper to lower
C++
0 vote399 views1 answer
Return array of string in function c++
C++
0 vote319 views3 answers
C++ loop maker
C++
1 vote325 views3 answers
('Failed to import pydot. You must `pip install pydot` and install graphviz (https://graphviz.gitlab.io/download/), ', 'for `pydotprint` to work.')
C++
0 vote299 views1 answer
C++ sort
C++
1 vote297 views1 answer
Remove last index of the string in c++
C++
0 vote303 views1 answer
Default rule of five c++
C++
0 vote294 views1 answer
C code to c++ converter
C++
0 vote339 views1 answer
C++ sorting and keeping track of indexes
C++

Share