Prime Sieve (1) Wagered Sieve method

The principle is to first 2-n all the numbers within an array, initialize all the numbers are prime, and then starting from 2 to look for, as long as the mark is a prime number of his all multiples of the mark is changed to composite, and so on. The time complexity is O (NLOGLOGN).

Code implementation

 1  void   Prime_table ()  2  3  for  (int  i=2 ;(LL) i<=n;i++) prime[i]=;  4   int  i=2 ;(LL) i*i<=n;i++)  Span style= "color: #008080;" >5  if  (Prime[i]) for  (LL j=i*i; j<=n;j+=i) Prime[j]=0   6 } 

Prime Sieve

Prime Sieve (1) Wagered Sieve method