/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 vote100 views2 answers
Grocery shopping list c++ chegg
C++
1 vote106 views1 answer
Summary a long walk to water
C++
1 vote104 views1 answer
Il2cpp unity stuck c#
C++
0 vote106 views1 answer
Str[i] - '0'
C++
0 vote111 views1 answer
Inverser les éléments d'un tableau manuellement en c++
C++
2 votes107 views1 answer
C++ wait for user input
C++
0 vote106 views1 answer
C++ write to file in directory
C++
0 vote121 views1 answer
Sort using lambda c++
C++
1 vote113 views1 answer
Multithreading
C++
0 vote162 views1 answer
C++ put a function in a other thread
C++

Share