/Python/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

1 vote120 views1 answer
Run django app locally
Python
1 vote124 views1 answer
Hashlib sha 256
Python
0 vote181 views1 answer
Apply with sf
Python
18 votes127 views3 answers
Get rid of n in string python
Python
0 vote128 views1 answer
Reactstrap example
Python
0 vote192 views1 answer
Testdata['time'].dt.tz_localize(None)
Python
0 vote162 views1 answer
Check this id exist in database django
Python Django
0 vote136 views1 answer
DatetimeProperties' object has no attribute 'weekday_name'
Python
0 vote146 views1 answer
Using built-in crawlers is very simple. A minimal example is shown as follows.
Python
0 vote81 views1 answer
Fibonacci sequence in python
Python

Share