/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 vote166 views1 answer
C++ code for bubble sort
C++
1 vote173 views1 answer
Operator precedence in cpp
C++
0 vote170 views1 answer
How to know the number of a certain substring in a string in c++
C++
3 votes168 views4 answers
C++ get last character of string
C++
5 votes172 views3 answers
Float max value c++
C++
4 votes174 views1 answer
Sort vector struct c++
C++
1 vote201 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
0 vote183 views1 answer
Bash script add another user
C++
7 votes170 views2 answers
C++ threads
C++
0 vote207 views1 answer
How to check char array equality in c++
C++

Share