Euclidean algorithm for finding GCD

function findGCD(num1, num2) {

    if (num1 > 0 && num2 > 0) {
        const val = num1 < num2 ? {
            min: num1,
            max: num2
        } : {
            min: num2,
            max: num1
        }
        return findGCD(val.max - val.min, val.min)
    }

    return num1 != 0 ? num1 : num2
}