/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 vote264 views1 answer
Srand() c++
C++
0 vote275 views1 answer
How many months have 31 days
C++
2 votes250 views1 answer
Print data type of a variable in c++
C++
12 votes263 views3 answers
Max element in array c++ stl
C++
1 vote256 views1 answer
Std string to wstring
C++
6 votes273 views1 answer
C++ replace character in string
C++
0 vote267 views2 answers
Function prototype c++
C++
0 vote280 views1 answer
Disallowcopy c++
C++
0 vote257 views1 answer
C++ terinary operator
C++
0 vote276 views1 answer
How to writte comment in c++
C++

Share