Create a boolean array " prime [ 0 . . n ] " and initialize all entries it as true . A value in prime [ i ] will finally be false if i is Not a prime , else true .
prime = new Array ( 100005 ) ; function SieveOfEratosthenes ( n ) { prime . fill ( true ) ; prime [ 1 ] = false ; for ( var p = 2 ; p * p <= n ; p ++ ) {