/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 vote185 views1 answer
Symfony functional test clear session and cookies
PHP
8 votes176 views1 answer
Laravel link storage to public
PHP Laravel
0 vote221 views1 answer
Comment désactiver la barre latérale Widgets sur des pages spécifiques WordPress
PHP
0 vote196 views1 answer
Php class file upload
PHP
10 votes187 views5 answers
Laravel exist
PHP
0 vote166 views1 answer
Php leggere file txt riga per riga
PHP
1 vote236 views3 answers
Laravel syncwithoutdetaching
PHP Laravel
1 vote215 views1 answer
Where year month laravel
PHP Laravel
0 vote179 views1 answer
Read file and convert each line in array php
PHP
0 vote178 views1 answer
Case inside laravel query
PHP

Share