E prime number sieve

 

 

void primes ( int n-) 
{ 
    Memset (VIS, 0 , the sizeof (VIS));
     for ( int I = 2 ; I <= n-; ++ I) 
    { 
        IF (VIS [I]) Continue ; 

        COUT << I < < endl; 

        for ( int J = I; J <= n-/ I; ++ J) // optimization, like 2 can be excluded 6 is a prime number, 3 can 
             VIS [I * J] = . 1 ; 
    } 
}