/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

0 vote131 views1 answer
Xgboost algorithm in python
Python
5 votes131 views1 answer
Matplotlib change thickness of line
Python
18 votes149 views3 answers
Dataframe check for nan in iterrows
Python
1 vote161 views1 answer
Jpython
Python
1 vote135 views1 answer
Numpy vector multiplication
Python
2 votes164 views1 answer
Import validation error in django
Python Django
1 vote141 views1 answer
5**5
Python
1 vote144 views1 answer
Python get last element of iterator
Python
0 vote128 views1 answer
ApiError('d984ac0ae28d4afda0ddb26e348db535', UploadError('path', UploadWriteFailed(reason=WriteError('malformed_path', None), upload_session_id='AAAAAAAAACLukDh6ck8ZUw'))) python
Python
0 vote142 views1 answer
Python font
Python

Share