/PHP/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

14 votes160 views2 answers
If part of stringp ph
PHP
0 vote152 views1 answer
Wordpress function _() not working
PHP
3 votes151 views1 answer
Codeigniter check insert
PHP
0 vote164 views1 answer
How to get only decimal value in php
PHP
0 vote166 views1 answer
Link acf
PHP
30 votes156 views6 answers
Artisan make auth
PHP
0 vote171 views2 answers
How to rollback if one table in laravel didn't save data successfully
PHP
3 votes177 views2 answers
Laravel first or fail
PHP Laravel
0 vote181 views1 answer
Laravel check if form has errors
PHP Laravel
1 vote170 views2 answers
Laravel dump]
PHP

Share