/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

5 votes226 views2 answers
"A non well formed numeric value encountered
PHP
2 votes220 views2 answers
Laravel dropIndex
PHP
1 vote233 views2 answers
Pointers php
PHP
1 vote237 views1 answer
Fatal error: Uncaught ReflectionException: Class config does not exist in
PHP
0 vote232 views1 answer
Laravel query foreach
PHP
0 vote222 views1 answer
Php send response without quitting
PHP
7 votes228 views10 answers
Php .com
PHP
0 vote243 views1 answer
Access to this resource on the server is denied laravel
PHP Laravel
0 vote226 views1 answer
Laravel count group by date
PHP
9 votes229 views3 answers
Start php session
PHP

Share