Calculate and display the Nth prime number using the Sieve of Eratosthenes algorithm

JavaScript

function SieveOfEratosthenes(primes) {


var IsPrime = Array(MAX_SIZE).fill(true);




var p, i;


for (p = 2; p * p < MAX_SIZE; p++) {




if (IsPrime[p] == true) {




for (i = p * p; i < MAX_SIZE; i += p)


IsPrime[i] = false;


}


}


for (p = 2; p < MAX_SIZE; p++)


if (IsPrime[p]) {


primes.push(p);


}


}




var N = 5;


var primes = [];


var MAX_SIZE = 1000005;


// Function call


SieveOfEratosthenes(primes);




document.write(N +


"th prime number is " + primes[N - 1] + "<br>"


);