C Language > Construction Prime number Table

1#include <stdio.h>2 #defineNumber 10003 4 intMain () {5     intIsprime[number];6      for(inti =0; I < number; i++){7Isprime[i] =1;8     }9     intx =2;Ten      while(X <Number ) { One         if(Isprime[x]) { A              for(inti =2; X*i < number; i++){ -Isprime[x*i] =0; -             } the         } -X + +; -     } -      for(inti =2; I < number; i++){ +         if(Isprime[i]) { -printf"%d\t", i); +         } A     } at     return 0; -}

List of construction primes
To construct a list of primes within n (not included)
1. Open Prime[n], initialize all its elements to 1,prime[x] to 1, table? x is the prime number
2. Make x=2
3. If x is a prime number, then for (i=2;x*i<n;i++) Order prime[i*x]=0
4. Make x + +, if x<n, repeat 3, otherwise end

C Language > Construction Prime number Table