[Algorithm] 8 week(2.28 ~ 3.6) 1/3

1979. Find Greatest Common Divisor of Array

var findGCD = function(nums) {
    const sortedNums = nums.sort((a, b) => a - b);
    const smallestNum = sortedNums[0];
    const largestNum = sortedNums[sortedNums.length - 1];
    
    return divisorNums(smallestNum, largestNum);
};

function divisorNums(small, largest) {
    let result = 1;

    for(let i = 2; i <= Math.min(small, largest); i++){
        if(small % i === 0 && largest % i === 0){
            result = i;
        }
    }

    return result;
}