/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 vote132 views1 answer
Add for input output file in c/c++
C++
0 vote201 views1 answer
Built in led
C++
174 votes201 views15 answers
Int to string c++
C++
0 vote139 views1 answer
Nike
C++
0 vote136 views1 answer
Ue4 modular character
C++
1 vote118 views1 answer
Quotation in c++ string
C++
0 vote1.5K views1 answer
9+20
C++
2 votes135 views1 answer
C++ flush stdin
C++
8 votes129 views2 answers
C++ function of find maximum value in an array
C++
0 vote122 views1 answer
How to get the last element of an array in C++ using std::array
C++

Share