エラトステネスの篩

primeNumber.js

'use strict';

function getPrimeNumberList(MAX) {
  var primeTable = [2];
  var workTable = (function(max) {
    var result = [];

    for (var i = 2; i < max; i++) {
      result.push(odd(i));
    }

    return result;

    function odd(n) {
      return 2 * n - 1;
    }
  })(MAX / 2 - 1);

  for (var i = 0, len = Math.sqrt(MAX); i < len; i++) {
    primeTable.push(workTable[0]);
    workTable = sieve(workTable);
  }

  return (primeTable.concat(workTable));

  function sieve(table) {
    var divisor = table.shift();

    return table.filter(function(v) {
      return isIndivisible(v, divisor);
    });

    function isIndivisible(num, divisor) {
      return (num % divisor) !== 0;
    }
  }
}

console.log(getPrimeNumberList(120));