javascript find prime factors code example
Example 1: prime factorization javascript
function primeFactors(n){
var factors = [],
divisor = 2;
while(n>2){
if(n % divisor == 0){
factors.push(divisor);
n= n/ divisor;
}
else{
divisor++;
}
}
return factors;
}
Example 2: prime factorization javascript
function primeFactors(n){
var factors = [],
divisor = 2;
while(n>=2){
if(n % divisor == 0){
factors.push(divisor);
n= n/ divisor;
}
else{
divisor++;
}
}
//contains duplicates, you should Array.prototype.filter() them out
return factors;
}