/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 vote139 views1 answer
Acf directions map link
PHP
0 vote138 views1 answer
Php session name
PHP
1 vote151 views1 answer
Nested resources laravel
PHP Laravel
1 vote153 views1 answer
Wordpress if is in categroy
PHP
0 vote153 views1 answer
Laravel retry failed transactions
PHP Laravel
0 vote124 views1 answer
Laravel model isdirty
PHP
0 vote154 views1 answer
Laravel follow and unfollow relationship
PHP Laravel
1 vote130 views1 answer
Php supress errors
PHP
0 vote126 views1 answer
What is actullay work model in laravel
PHP
0 vote147 views1 answer
Fallo al conectar al servidor ftp wordpress
PHP Wordpress

Share