prime-finder-nam

Benchmark created by Nam on March 3, 2016

Description

Setup

function prime1(num) {
      var primes = [];
      loop: for (var i = 2; i <= num; i++) {
        for (var j = 0; j <= primes.length; j++)
          if (i % primes[j] === 0) continue loop;
        primes.push(i);
      }
      return primes;
    }
    
    function primeNam(num) {
      // Generate an array containing every prime number between 0 and the num specified (inclusive)
      var numbers = Array.apply(null, {length: num + 1}).map(Number.call, Number).slice(2);
      var sqrt = Math.ceil(Math.sqrt(num));  
      
      // Sieve of Eratosthenes
      for (var i = 0; numbers[i] < sqrt; i++) {
        numbers = numbers.filter(n => (n === numbers[i] || n%numbers[i]));
      }
      
      return numbers;  
    }

Test runner

prime1(1000);

primeNam(1000);

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.

• Revision 1: published by Nam on March 3, 2016