/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

10 votes209 views2 answers
Laravel list all routes
PHP
2 votes198 views1 answer
Null coalescing operator example in php
PHP
0 vote227 views1 answer
Php explode multiple delimiters
PHP
1 vote200 views1 answer
Orderby text values eliquent laravel
PHP
18 votes230 views4 answers
Use if in laravel blade
PHP Laravel
3 votes254 views1 answer
Back route laravel
PHP Laravel
49 votes247 views6 answers
Laravel clear all cache
PHP Laravel
5 votes207 views3 answers
Laravel drop column if exists
PHP
0 vote209 views1 answer
Laravel storage save file folder on disk
PHP
33 votes240 views4 answers
Carbon format date in laravel
PHP Laravel

Share