Prime Factor function

by fosco

JavaScript

function primeFactorTree(number, div, arr) {
    div = div || 2;
    arr = arr || [];

    if (number % div === 0) {
        number /= div;
        arr.push(div);
        if (number == 1) {
            return arr;
        }
    } else {
        ++div;
    }

    return primeFactorTree(number, div, arr);
}

var p = primeFactorTree(24);

console.log(p);