/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

7 votes272 views3 answers
Php login system
PHP
0 vote256 views1 answer
Php expire session for 1 month
PHP
0 vote259 views1 answer
Buddy group hide notice join
PHP
0 vote280 views1 answer
Woocommerce pagination
PHP
1 vote268 views2 answers
Send axios request to php
PHP
3 votes292 views1 answer
Send multiple mail in laravel
PHP
0 vote256 views1 answer
Symfony functional test clear session and cookies
PHP
0 vote275 views1 answer
Check current user role
PHP
0 vote248 views1 answer
Nano seed generator
PHP
6 votes353 views2 answers
WhereHas site:https://laravel.com/docs/
PHP Laravel

Share