The sieve of Eratosthenes is an ancient algorithm and is one of the most efficient ways to find all primes up to any given limit.

sieveOfEratosthenes.js

function seive(n){
 const arr = Array.from({length: n}, (_,i) => i > 1 ? i : false),
  limit = Math.sqrt(n);

  for(let i = 0; i < limit; i++){
    let j = i*i;
    while (j <= n) {
      arr[j] = false;
      j = j+i;
    }
  }

  return arr.filter(Boolean);
}


seive(20) 

/**
* output: [ 2,  3,  5,  7,11, 13, 17, 19 ]
*/