/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 vote241 views1 answer
Convert a hexadecimal number into decimal c++
C++
0 vote215 views10 answers
Loop
C++
1 vote236 views1 answer
Eosio name to string
C++
3 votes167 views2 answers
Lambda function in c++
C++
0 vote213 views1 answer
Ifstream file (“code2.txt”); dev C++
C++
11 votes179 views1 answer
Strcmp different length
C++
23 votes179 views3 answers
Flutter datetime format
C++
99 votes476 views6 answers
How to convert int to string c++
C++
0 vote191 views1 answer
Program to swap max and min in matrix
C++
1 vote177 views1 answer
Map in c
C++

Share