sieve-of-eratosthenes.js

const primeSeive = (n) => {
    const primes = []
    // Start with an array of all numbers between 2 and n
    let buf = Array(n - 1).fill().map((_, i) => i + 2);
    let pointer = 0;

    while (pointer < buf.length) {
        const p = buf[pointer];
        // Push the prime
        primes.push(p);
        // Remove all multiples of p from the buf skipping the first one
        for (let i = pointer + p; i < buf.length; i += p) {
            buf[i] = null;
        }

        // Advance the pointer to the next non null number;
        do {
            pointer += 1;
        } while(buf[pointer] === null) 
    }

    return primes;
}

console.log(primeSeive(100));