/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

2 votes181 views3 answers
C++ string find last number
C++
1 vote190 views2 answers
C++ cast to type of variable
C++
0 vote175 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
0 vote197 views2 answers
C++ namespace
C++
1 vote211 views1 answer
Ceil value in c++ using formula
C++
2 votes185 views6 answers
Loop in c++
C++
0 vote200 views1 answer
Find the max element along with it's index in c++
C++
0 vote223 views1 answer
Export gcc g++
C++
0 vote182 views1 answer
Batch to exe
C++
3 votes196 views3 answers
Quick sort c++
C++

Share