/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 vote168 views1 answer
Rock paper scissors python
Python
30 votes173 views3 answers
Pandas add a total row to dataframe
Python
0 vote162 views1 answer
How to import date python
Python
1 vote156 views1 answer
How to run the server in django
Python
15 votes166 views2 answers
Insert string into middle of list python
Python
1 vote164 views1 answer
How to append leading zeros in python
Python
8 votes161 views1 answer
Numpy where
Python
0 vote187 views1 answer
Field 'id' expected a number but got <django.db.models.fields.related_descriptors.create_forward_many_to_many_manager.<locals>.ManyRelatedManager object at 0x7fb02044de80>
Python
0 vote158 views1 answer
K means image classification
Python
0 vote182 views1 answer
Parsing a file and adding a number at starting of every line sentence python
Python

Share