"how to get the prime number in c++ where time complexity is 0(log n)" Code Answer's
You're definitely familiar with the best coding language C++ that developers use to develop their projects and they get all their queries like "how to get the prime number in c++ where time complexity is 0(log n)" answered properly. Developers are finding an appropriate answer about how to get the prime number in c++ where time complexity is 0(log n) related to the C++ coding language. By visiting this online portal developers get answers concerning C++ codes question like how to get the prime number in c++ where time complexity is 0(log n). Enter your desired code related query in the search bar and get every piece of information about C++ code related question on how to get the prime number in c++ where time complexity is 0(log n).
how to get the prime number in c++ where time complexity is 0(log n)
// 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;
}
All those coders who are working on the C++ based application and are stuck on how to get the prime number in c++ where time complexity is 0(log n) can get a collection of related answers to their query. Programmers need to enter their query on how to get the prime number in c++ where time complexity is 0(log n) related to C++ code and they'll get their ambiguities clear immediately. On our webpage, there are tutorials about how to get the prime number in c++ where time complexity is 0(log n) for the programmers working on C++ code while coding their module. Coders are also allowed to rectify already present answers of how to get the prime number in c++ where time complexity is 0(log n) while working on the C++ language code. Developers can add up suggestions if they deem fit any other answer relating to "how to get the prime number in c++ where time complexity is 0(log n)". Visit this developer's friendly online web community, CodeProZone, and get your queries like how to get the prime number in c++ where time complexity is 0(log n) resolved professionally and stay updated to the latest C++ updates.