/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

1 vote245 views1 answer
Laravel group by created_at date only
PHP Laravel
1 vote203 views2 answers
Download php7.4-mbstring ubuntu
PHP
10 votes233 views3 answers
Remove package in laravel
PHP
0 vote210 views1 answer
Php send 204
PHP
1 vote207 views1 answer
Laravel realation with has
PHP
0 vote223 views1 answer
Model get last query in php
PHP
2 votes201 views1 answer
Download a file from external server using PHP - Move one project to another server
PHP
1 vote195 views1 answer
Laravel plural and singular
PHP
0 vote232 views1 answer
Group_concat mysql limit issue
PHP
1 vote218 views3 answers
Htaccess php version
PHP

Share