Answers for "greatest common divisor algorithm"

greatest common divisor euclidean algorithm

def gcd(a,b):
    print(a,b)
    if b == 0:
        return a
    
    return gcd(b, a%b)

greatest common divisor

/* Function using "Euclidian Algorithm" to recursively find the 
greatest common divisor/factor (GCD/GCF) of 2 positive numbers*/
const gcf = function (small, large) {
    let r = large % small;
    if (r == 0)
        return small;
    else
        return gcf(r, small);
}

gcd algorithm

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)