/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 vote134 views1 answer
Run 2 loops simultaneously python
Python
0 vote224 views1 answer
Megre pandas in dictionary
Python
1 vote183 views1 answer
How to pass data between views django
Python
1 vote137 views1 answer
Keras.layers.simplernn
Python
0 vote118 views1 answer
Convert to date format
Python
5 votes131 views1 answer
How to rezize image in python tkinter
Python
0 vote138 views1 answer
How to get a summary of a column in python
Python
0 vote140 views1 answer
Sqlalchemy one to one foreign key
Python
0 vote138 views1 answer
Python remove second occurrence of character in string
Python
0 vote146 views1 answer
Get data from s3 bucket python
Python

Share