/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

36 votes251 views3 answers
How to type hello world in c++
C++
0 vote230 views1 answer
Implementing split function in c++
C++
0 vote218 views1 answer
How to get characters through their ascii value in c++
C++
21 votes295 views3 answers
C++ access second last element of vector
C++
0 vote258 views1 answer
Inverser les éléments d'un tableau manuellement en c++
C++
0 vote230 views1 answer
C++ erase last element of set
C++
1 vote232 views1 answer
G++ -wall option meaning
C++
0 vote243 views1 answer
SPEED c++
C++
0 vote243 views1 answer
C++ main function parameters
C++
0 vote218 views1 answer
Sideways triangle c++ xy plane
C++

Share