primeFactorization.js

function isPrime(n) {
  if (n === 2) return true;
  for (let i = 2; i <= Math.sqrt(n); i++)
    if (n % i === 0) return false;
  return true;
}

function primeFactorization(n) {
  let d = [];
  for (let i = 2; i < n; i++)
    if (n % i === 0) { d.push(n / i, i); break; }
  if (d.length === 0) return [1, n];
  for (let i in d) if (!isPrime(d[i])) d.splice(i, 1, ...primeFactorization(d[i]));
  return d.sort((a, b) => a - b);
}