/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

1 vote106 views1 answer
How todelete a line in python
Python
0 vote119 views1 answer
Round list of floats python
Python
1 vote124 views2 answers
Pandas sort values group by
Python
0 vote119 views2 answers
How to format integer to two digit in python
Python
0 vote111 views1 answer
Custom django password checker
Python
1 vote121 views1 answer
Easiest way to position labels in tkinter
Python
0 vote155 views1 answer
Matplotlib keyboard event
Python
4 votes117 views1 answer
How to import reverse
Python
4 votes109 views2 answers
Split filename and extension python
Python
0 vote113 views1 answer
Creating a record in python
Python

Share