Sieve of Eratosthenes prime number series in CPP program
Example:1 Sieve of Eratosthenes prime number series in CPP program #include<iostream> using namespace std; void primeSieve(int n) { int prime[100]={0}; for(int i=2;i<=n;i++) { if(prime[i]==0){ for(int j=i*i;j<=n;j+=i){ prime[i]==1; } } } for(int i=2;i<=n;i++) { if(prime[i]==0) { cout<<i<<” “; }cout<<endl; } } int main() { int a; cin>>a; primeSieve(a); }