/Python/Euclid's algorithm

Euclid's 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's algorithm

def GCF(a,b):
  if a == b: return a
  else: return GCF(abs(a-b), min(a,b))

0

Euclid algorithm

 function mcd($a,$b) {
	while($b) list($a,$b)=array($b,$a%$b);
	return $a;
}

0

Euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a

0

Similar codes

5 votes380 views1 answer
How to fill nas on a dataframe with median
Python
1 vote414 views1 answer
Hide particular attribute in django admin
Python Django
0 vote398 views1 answer
Django check if user is staff in template
Python Django
0 vote352 views1 answer
IBM Maximo automation python
Python
3 votes345 views6 answers
Python printing
Python
25 votes367 views3 answers
Download youtube video in python
Python
0 vote369 views1 answer
Python OrderedDict - LRU
Python
8 votes355 views3 answers
Python is integer string
Python
2 votes348 views3 answers
0 1 1 2 3 5 in python
Python
0 vote316 views1 answer
Runpy.py", line 194, in _run_module_as_main return _run_code(code, main_globals, None,
Python

Share