/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

0 vote271 views1 answer
Wpml language switcher shortcode
PHP
5 votes309 views5 answers
Laravel composer update
PHP Laravel
0 vote252 views1 answer
Laravel raw query join many to many
PHP
8 votes259 views1 answer
Laravel storage not found
PHP Laravel
16 votes271 views6 answers
Laravel group routes
PHP Laravel
2 votes267 views2 answers
Validate password laravel
PHP Laravel
2 votes280 views2 answers
Ubuntu restart php-fpm
PHP
0 vote267 views2 answers
Laravel use global variable in model
PHP
0 vote262 views1 answer
Php artisan make:widget
PHP
0 vote269 views1 answer
Laravel lazy loading
PHP Laravel

Share