/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 vote232 views1 answer
Php location same page
PHP
0 vote304 views1 answer
Wordpress plugin public page
PHP Wordpress
0 vote279 views1 answer
Get product price wordpress
PHP Wordpress
1 vote253 views1 answer
Laravel eloquent get 10 records
PHP
0 vote273 views2 answers
Request get query string laravel
PHP
1 vote243 views2 answers
Install php unzip
PHP
15 votes276 views3 answers
Laravel timezone
PHP Laravel
0 vote255 views1 answer
Laravel add many to many
PHP
2 votes265 views3 answers
Multiple primary key defined laravel
PHP Laravel
0 vote256 views1 answer
Drupal 9 select node data with query conditions using entity type manager
PHP

Share