# Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range

This is java program to implement Wheel Seive method to generate the prime numbers from 2 to the given limit. This algorithm reduces the time by checking only till n^2.

Here is the source code of the Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

//This is a sample program to print all the prime numbers between 2 and n
import java.util.Scanner;

public class Sieve_Method
{
{
if(n < 2)

for(int i = 2;i <= n;i++)
{ //unoptimized
}

while(nums.size() > 0)
{
int nextPrime = nums.remove();
for(int i = nextPrime * nextPrime;i <= n;i += nextPrime)
{
nums.removeFirstOccurrence(i);
}
}
return primes;
}
public static void main(String args[])
{
System.out.println("Enter the upper bound : ");
Scanner sc = new Scanner(System.in);
int end = sc.nextInt();

System.out.println(sieve(end));
sc.close();

}
}


Output:

$javac Sieve_Method.java$ java Sieve_Method
Enter the upper bound :
70
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67]