Function for finding all prime numbers up to any given limit (Sieve of Eratosthenes)

getPrimes.js

function getPrimes (n) {
  const sieve = new (Uint32Array || Array)(n + 1);
  const primes = [];
  const length = sieve.length;
  const limit = Math.floor(Math.sqrt(n + 1))
  let p = 0;
  let m = 0;
  
  for (p = 2; p <= limit; p++) {
    for (m = p * 2; m < length; m += p){
      sieve[m] = 1;
    }
  }
  for (p = 2; p <= length; p++){
    if (!sieve[p]){
      primes.push(p);
    }
  }
  return primes;
}