/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

0 vote139 views1 answer
Librosa from array to audio
Python
0 vote132 views1 answer
Writing Bytes to a File in python
Python
0 vote136 views2 answers
Install cairo python
Python
5 votes154 views2 answers
Python train test val split
Python
0 vote135 views1 answer
Created by and updated by in django
Python
1 vote139 views1 answer
Django making a custom 403 page
Python
3 votes158 views2 answers
Pygame bg color
Python
0 vote138 views1 answer
Django password field encryption
Python
0 vote136 views1 answer
Downloading datasets from ml.org repository
Python
3 votes138 views1 answer
How set dely in python
Python

Share