Sieve of Eratosthenes, raw javascript implementation

sieve.js

n = 10;

var nlist = [];

// Generate the list of desired numbers
for(var i = 2; i < n; i++){
  nlist.push(true);
}

// Mark each non-prime as false
var x = 2;
for(var i = 2; i < Math.sqrt(n); i++){
  if(nlist[i]){
    for(var j = i*i; j < n; j += i){
      nlist[j] = false;
    }
  }
}

// Print out all index numbers correlated to true values
var primes = [];
for(var i = 2; i < n; i++){
  if(nlist[i]){
    primes.push(i)
  }
}

console.log(primes);