Answers for "eucliden algorithm"

euclid algorithm

int Euclid(int a, int b)
{
    int r;
    while(b != 0) 
    {
         r = a % b;
         a = b; 
         b = r; 
    }
    return a; 
}

Eucliden Algorithm

int gcd(int a, int b)
{
    int r;
    if (a < 0) a = -a;
    if (b < 0) b = -b;
    if (b > a) { /* swap */
        r = b; b = a; a = r;
    }
    while (b > 0) {
        r = a % b;
        a = b;
        b = r;
    }
    return a;
}

euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a