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 .
bool [ ] prime = new bool [ n + 1 ] ; Array . Fill ( prime , true ) ; int p = 2 ; while ( p * p <= n ) {