Generate all prime numbers between two given numbers. The task is to print prime numbers in that range. The Sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n where n is smaller than 10 million or so.

Examples:

Input :start = 50 end = 100Output :53 59 61 67 71 73 79 83 89 97Input :start = 900 end = 1000Output :907 911 919 929 937 941 947 953 967 971 977 983 991 997

Idea is to use Sieve of Eratosthenes as a subroutine. Firstly, find primes in the range from 0 to start and store it in a vector. Similarly, find primes in the range from 0 to end and store in another vector. Now take the set difference of two vectors to obtain the required answer. Remove extra zeros if any in the vector.

`// C++ STL program to print all primes ` `// in a range using Sieve of Eratosthenes ` `#include<bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `typedef` `unsigned ` `long` `long` `int` `ulli; ` ` ` `vector<ulli> sieve(ulli n) ` `{ ` ` ` `// Create a boolean vector "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. ` ` ` `vector<` `bool` `> prime(n+1,` `true` `); ` ` ` ` ` `prime[0] = ` `false` `; ` ` ` `prime[1] = ` `false` `; ` ` ` `int` `m = ` `sqrt` `(n); ` ` ` ` ` `for` `(ulli p=2; p<=m; p++) ` ` ` `{ ` ` ` ` ` `// If prime[p] is not changed, then it ` ` ` `// is a prime ` ` ` `if` `(prime[p]) ` ` ` `{ ` ` ` `// Update all multiples of p ` ` ` `for` `(ulli i=p*2; i<=n; i += p) ` ` ` `prime[i] = ` `false` `; ` ` ` `} ` ` ` `} ` ` ` ` ` `// push all the primes into the vector ans ` ` ` `vector<ulli> ans; ` ` ` `for` `(` `int` `i=0;i<n;i++) ` ` ` `if` `(prime[i]) ` ` ` `ans.push_back(i); ` ` ` `return` `ans; ` `} ` ` ` `// Used to remove zeros from a vector using ` `// library function remove_if() ` `bool` `isZero(ulli i) ` `{ ` ` ` `return` `i == 0; ` `} ` ` ` `vector<ulli> sieveRange(ulli start,ulli end) ` `{ ` ` ` `// find primes from [0..start] range ` ` ` `vector<ulli> s1 = sieve(start); ` ` ` ` ` `// find primes from [0..end] range ` ` ` `vector<ulli> s2 = sieve(end); ` ` ` ` ` `vector<ulli> ans(end-start); ` ` ` ` ` `// find set difference of two vectors and ` ` ` `// push result in vector ans ` ` ` `// O(2*(m+n)-1) ` ` ` `set_difference(s2.begin(), s2.end(), s1.begin(), ` ` ` `s2.end(), ans.begin()); ` ` ` ` ` `// remove extra zeros if any. O(n) ` ` ` `vector<ulli>::iterator itr = ` ` ` `remove_if(ans.begin(),ans.end(),isZero); ` ` ` ` ` `// resize it. // O(n) ` ` ` `ans.resize(itr-ans.begin()); ` ` ` ` ` `return` `ans; ` `} ` ` ` `// Driver Program to test above function ` `int` `main(` `void` `) ` `{ ` ` ` `ulli start = 50; ` ` ` `ulli end = 100; ` ` ` `vector<ulli> ans = sieveRange(start,end); ` ` ` `for` `(` `auto` `i:ans) ` ` ` `cout<<i<<` `' '` `; ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

53 59 61 67 71 73 79 83 89 97

This article is contributed by **Varun Thakur**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Rated as one of the most sought after skills in the industry, own the basics of coding with our **C++ STL** Course and master the very concepts by intense problem-solving.

## Recommended Posts:

- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Prime numbers in a given range using STL | Set 2
- Count all prime numbers in a given range whose sum of digits is also prime
- Count numbers in a given range whose count of prime factors is a Prime Number
- Print the nearest prime number formed by adding prime numbers to N
- Print prime numbers with prime sum of digits in an array
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Count pairs from a given range whose sum is a Prime Number in that range
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Count prime numbers that can be expressed as sum of consecutive prime numbers
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Print even and odd numbers in a given range using recursion
- Count numbers from range whose prime factors are only 2 and 3 using Arrays | Set 2
- Sum of all the prime numbers in a given range
- Queries for the difference between the count of composite and prime numbers in a given range
- Count of Double Prime numbers in a given range L to R
- C/C++ Program to find Prime Numbers between given range