Sign in Get Started

sieve of eratosthenes c++

Francesco Casula 
// C++ program to print all primes smaller than or equal to 
// n using Sieve of Eratosthenes 
#include <bits/stdc++.h> 
using namespace std; 

void SieveOfEratosthenes(int n) 
{ 
	// 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[n+1]; 
	memset(prime, true, sizeof(prime)); 

	for (int p=2; p*p<=n; p++) 
	{ 
		// If prime[p] is not changed, then it is a prime 
		if (prime[p] == true) 
		{ 
			// Update all multiples of p greater than or 
			// equal to the square of it 
			// numbers which are multiple of p and are 
			// less than p^2 are already been marked. 
			for (int i=p*p; i<=n; i += p) 
				prime[i] = false; 
		} 
	} 

	// Print all prime numbers 
	for (int p=2; p<=n; p++) 
	if (prime[p]) 
		cout << p << " "; 
} 

// Driver Program to test above function 
int main() 
{ 
	int n = 30; 
	cout << "Following are the prime numbers smaller "
		<< " than or equal to " << n << endl; 
	SieveOfEratosthenes(n); 
	return 0; 
}
View another examples Add Own solution
Log in, to leave a comment

4
7
Meep 105 points 

                                    //sieve of eratosthenes or prime of sieve
#include&lt;iostream&gt;
#include&lt;math.h&gt;
using namespace std;
void primeofsieve(long long int n)
{
	long long int arr[n]={};
	for(int i=2;i&lt;=sqrt(n);i++)
	{
		for(long long int j=i*i;j&lt;=n;j+=i)
			arr[j]=1;
	}
	for(long long int i=2;i&lt;=n;i++)
	{
	    if(arr[i]==0)
	    	cout&lt;&lt;i&lt;&lt;&quot; &quot;;
	}


}
int main()
{

	#ifdef _DEBUG
	freopen(&quot;input.txt&quot;, &quot;r&quot;, stdin);
	freopen(&quot;output.txt&quot;, &quot;w&quot;, stdout);
    #endif
	long long int n;
	cin&gt;&gt;n;
	cout&lt;&lt;&quot;PRIME NUMBERs ARE : &quot;;
	primeofsieve(n);
	return 0;
}

4 (7 Votes)
0
0
7
Toandfro 80 points 

                                    #include &lt;iostream&gt;
const int len = 30;
int main() {
&nbsp; &nbsp;int arr[30] = {0};
&nbsp; &nbsp;for (int i = 2; i &lt; 30; i++) {
&nbsp; &nbsp; &nbsp; for (int j = i * i; j &lt; 30; j+=i) {
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr[j - 1] = 1;
&nbsp; &nbsp; &nbsp; }
&nbsp; &nbsp;}
&nbsp; &nbsp;for (int i = 1; i &lt; 30; i++) {
&nbsp; &nbsp; &nbsp; if (arr[i - 1] == 0)
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;std::cout &lt;&lt; i &lt;&lt; &quot;\t&quot;;
&nbsp; &nbsp;}
}

0
0
4
3
PrincessLilly 110 points 

                                    int n;
vector&lt;bool&gt; is_prime(n+1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i &lt;= n; i++) {
    if (is_prime[i] &amp;&amp; (long long)i * i &lt;= n) {
        for (int j = i * i; j &lt;= n; j += i)
            is_prime[j] = false;
    }
}

4 (3 Votes)
0
4
10
Radha Krishnan 90 points 

                                    int n;
vector&lt;char&gt; is_prime(n+1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i &lt;= n; i++) {
    if (is_prime[i] &amp;&amp; (long long)i * i &lt;= n) {
        for (int j = i * i; j &lt;= n; j += i)
            is_prime[j] = false;
    }
}

4 (10 Votes)
0
Are there any code examples left?
Find Add Code snippet
New code examples in category C++
SHOW MORE
Create a Free Account
Unlock the power of data and AI by diving into Python, ChatGPT, SQL, Power BI, and beyond.
Sign up
Develop soft skills on BrainApps
Complete the IQ Test
Relative searches
sieve of eratosthenes code in c++ sieve of eratosthenes c++ time complexity Eratosthenes&amp;rsquo;s sieve algorithm sieve prime complexity sieve of eratosthenes c++ cp algorithms c++ sieve of eratosthenes code sieve of eratosthenes c++ not working sieve of eratosthenes o(n) c++ sieve of prime sieve and prime sieve sieve of eratosthenes in cpp is prime sieve sieve of eratosthenes c+ sieve for primes eratosthenes sieve in c++ sieve of eratostenes c++ sieve primes sieve of \ sieve method of number of primes prime sieve algorithms optimization time in sieve of eratosthenes code c optimization time in sieve of eratosthenes in c sieve of eratosthenes c program f sieve of eratosthene HW - Sieve of Eratosthene optimization medium time function in c optimization time seven of erastothenes c optimization seven of erastothenes c HW - Sieve of Eratosthenes time funciton in c sieve of eranthoses optimization sevent of erastotenes &quot;Sieve of Eratosthenes c program time execution optimization seive odf erasthonese sieve of erathso owing the original and n&auml;ive definition of the method: Starting from 2, mark all the multiples of that number as not primes and then move to the next unmarked number. When there are no more numbers left, the unmarked numbers are the primes. Example: sieve of eratosthenes spf c++ sieve prime algorithm eratosthenes prime numbers sieve Generate a list of all numbers between 0 and N; mark the numbers 0 and 1 to be not prime print first n prime numbers using sieve prime1 spoj sieve of eratosthenes sieve algorithm java prime number sieve c++ sieve of eratostes prime sieve of size 1000000 sieve algorithm for finding prime numbers sieve prime numbers hwo to generate sieve of prime numbers for large sieve prime number sieve of eratosthenes c++ most optimized code when seive code is used in prime numbers sieve algo sieve gfg sieve implimentation The Sieve of Eratosthenes is an algorithm for finding all prime numbers less than or equal to a number N . Read about this algorithm on Wikipedia and implement it in a Python program. Filename: find_primes.py sieves algorithm primes number sieve primes sieve prime numbers between c++ using sieve alll prime numbers using seive of eratostethens how old is sieve of eratosthenes sieve of eratosthenes c++ efficient simple prime algorithm implemention sieve of erostheses sieve of eresthossis gfg sieve of eratosthenes c++ gfg sieve of Eratosthenes algorithm. sieve of eratosthenes generator first n prme numbers sieve of eratosthenes prime numbers eratosthenes sieve complexity of finding all prime numbers application of sieve of eratosthenes sieve of eratosthenes java erasthones sieve printing prime numbers seive an algorithm which finds the prime number up to n ( sieve of eratosthenes in c++ Develop an algorithm which finds the prime number up to n sieve of eratosthenes implementation at gfg code for sieve of eratosthenes prime numbers less than k c++ nlogn sieve #include&lt;bits/stdc++.h&gt; using namespace std; #define MAX 10000000 bool prime[MAX+1]; void SieveOfEratosthenes() Eratosthenes&rsquo;s sieve algorithm Which of the following Algorithm(s) uses prime numbers sieve of eratosthenes algorithm in c sieve of eratosthenes proime number sieve of primes check if a number is prime using sieve seive for prime numbers less than n sieve of eratosthenes in c++ program code for sieve of eratosthenes in c++ sieve algorithm prime numbers seive of erathones code sieve of erathoneses sieve prime print first n prime numbers in c++ seive of eratosthenes sieve algorithm erasthonus sieve in sieve prime why use I*I prime numbers sieve of eratosthenes prime sieve method sieve of erathoses seive algorithm seive code prime number java Sieve of Eratosthenes c program for sieve of eratosthenes c program for sieve of eratosthenes functions sieve of eratosthenes program in c using functions sieve algorithm in c sieve of eratosthenes program in c sieve of ertosthenes eratosthenes sieve c check prime sieve of eratosthenes eratosthenes' sieve c Sieve of Eratosthenes to find all the prime numbers between 2 and 5000 C++ a program that uses the Sieve of Eratosthenes to find all the prime numbers between 2 and 5000 C++ a program that uses the Sieve of Eratosthenes to find all the prime numbers between 2 and 5000. first n prime numbers using sieve of eratosthenes simple prime sieve sieve eratosthenes generating n prime numbers using seive of err in c++ sieve of eratosthenes c++ proof prime number sieve find all the prime numbers from 1 to n using sieve of erastothenes sieve of eratostehenes find first n prime numbers c++ sieve of eratosthenes prime eratosthenes in cpp the sieve of Eratosthenes sieve of eratosthenes n number of prime numbers sieve of eratosthmes seives algo for primes sieve of eratosthenes algorith, Sieve of Eratosthenes. eratosthenes sieve c++ isieve of primes c++ sieve of eratosthenes for prime numbers eratosthenes prime sieve print prime numbers up to less than n in c in O(n) time complexity sieve of prime numbers sieve of eranthoses in c++ sieve of eratosthenes implementation sieve of eratos calculate prime numbers with sieve of eratosthenes algorithm for finding all prime numbers up to any given big limit sieve of eratosthenes c program sieve of erastosthenes find all prime numbers less than 100 gfg code using sieve of erasth eratosthenes sieve code prime sieve algorithm c++ eratosthen sieve c Function sieveOfEratosthenes must find all prime numbers up to 10,000 by marking an array in the manner described below so that there is a P above each prime number, and there is an N above each non-prime number. eratosthenes algorithm sieve of eratosthenes fo 10^10 find the prime no in range cpp seive sieve de eratostenes how to find prime numbers seize of estrogen sieve algorithm? c++ sieve of eratosthenes logic for sieve of eratosthenes most efficient prime number algorithm prime numbers using sieve of eratosthenes gfg sieve of eratosthenes sieve of eratosthenes algorithm sieve function c++ eratostheens sieve sieve eratosthenes prime numbers sieve of eratho sieve in c++ built in function for sieve of eratosthenes sieve of eratosthenes prime numbers c++ optimize prime sieve in c++ sieve algorithm c++ code sieve of eratosthenes code for finding prime numbers upto a n inc++ sieve function in c++ sieve of eratosthenes c++ code A Question based on GCD with the sieve of Eratosthenes. Sieve of Eratosthenes cpp prime seive code sieve of eratosthenes gfg java how to use sieve of eranthoses in code efficient algorithm to find prime given an array sieve of eratosthenes method with an example sieve c++ Sieve_of_Eratosthenes c++ prime seive code cpp sieve code in c++ sieve_of_eratosthenes prime number sieve of eratosthenes prime of sive question why does The Sieve of Eratosthenes is correct prime seive Sieve of Eratosthenes sieve of Eratosthenes c sievegeeks ranged Sieve of Eratosthenes java prime sieve function c++ sieve of eratosthenes log c++ using sieve of eratosthenes Sieve of Eratosthenes in c++ expalin? sieve of eratosthenes in c sieve of era sieve of eratosthenes other name sieve geeks for geeks SieveOfEratosthenes seive geeks sieve of eratosthenes most efficient way to generate prime numbers till a given n value what is sieve of eratosthenes prime sieve prime of sieve prime sieve c++ psuedo-code implementation of linear sieve sieve of eratosthenes code eratosthenes algorithm c++ sieve algorithm c++ sieve of eratosthenes cpp sieve of eratosthenes c++
Made with love
This website uses cookies to make IQCode work for you. By using this site, you agree to our cookie policy

Welcome Back!

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign in
Recover lost password
Or log in with
Not registered?
Sign up takes less than a minute

Create a Free Account

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign up
Or sign up with
By signing up, you agree to the Terms and Conditions and Privacy Policy. You also agree to receive product-related marketing emails from IQCode, which you can unsubscribe from at any time.
Creating a new code example
Code snippet title
Source