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 .
boolean prime [ ] = new boolean [ MAX_PRIME + 1 ] ; Arrays . fill ( prime , true ) ; for ( int p = 2 ; p * p <= MAX_PRIME ; p ++ ) {