ECMAScript 6 implementation of Sieve of Eratosthenes algorithm https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

primes.js

'use strict';
function* getPrimes(n) {
    let compos = [];
    for (let i = 2; i <= n; i++) {
        if (compos[i]) continue;
        yield i;
        for (let j = i * 2; j <= n; j += i) {
            compos[j] = true;
        }
    }
}

function toArray(iterator) {
    // Using array comprehensions (not supported in node v0.11.23):
    // return [prime for (prime of iterator)];
    let array = [];
    for (let prime of iterator) {
        array.push(prime);
    }
    return array;
}

function print(n) {
    for (let prime of getPrimes(n)) {
        console.log(prime);
    }
}

function benchmark(n, iterations) {
    let start = new Date;
    for (let j = 0; j < iterations; j++) {
        toArray(getPrimes(n));
    }
    return new Date - start;
}

console.log(benchmark(10000, 500));
// print(10000000);