- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
C++ Program to Implement Segmented Sieve to Generate Prime Numbers Between Given Range
This is C++ program to implement Segmented Sieve to Generate Prime Numbers Between Given Range. Segmented Sieve first uses Simple Sieve to find primes smaller than or equal to √(n). The idea of this algorithm is to divide the range [0 ... n-1] in different segments and compute primes in all segments one by one.
Algorithm
Begin Create function to find all primes smaller than limit using simple sieve of eratosthenes. Finds all prime numbers in given range using segmented sieve A) Compute all primes smaller or equal to square root of high using simple sieve B) Count of elements in given range C) Declaring boolean only for [low, high] D) Find the minimum number in [low ... high] that is a multiple of prime[i] (divisible by prime[i]) E) Mark multiples of prime[i] in [low … high] F) Numbers which are not marked in range, are prime End
Example Code
#include <bits/stdc++.h> using namespace std; void simpleSieve(int lmt, vector<int>& prime) { bool mark[lmt + 1]; memset(mark, false, sizeof(mark)); for (int i = 2; i <= lmt; ++i) { if (mark[i] == false) { prime.push_back(i); for (int j = i; j <= lmt; j += i) mark[j] = true; } } } void PrimeInRange(int low, int high) { int lmt = floor(sqrt(high)) + 1; vector<int> prime; simpleSieve(lmt, prime); int n = high - low + 1; bool mark[n + 1]; memset(mark, false, sizeof(mark)); for (int i = 0; i < prime.size(); i++) { int lowLim = floor(low / prime[i]) * prime[i]; if (lowLim < low) lowLim += prime[i]; for (int j = lowLim; j <= high; j += prime[i]) mark[j - low] = true; } for (int i = low; i <= high; i++) if (!mark[i - low]) cout << i << " "; } int main() { int low = 10, high = 50; PrimeInRange(low, high); return 0; }
Output
11 13 17 19 23 29 31 37 41 43 47
Advertisements
To Continue Learning Please Login
Login with Google