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.LinkedList;
import java.util.Scanner;
public class Sieve_Method
{
public static LinkedList<Integer> sieve(int n)
{
if(n < 2)
return new LinkedList<Integer>();
LinkedList<Integer> primes = new LinkedList<Integer>();
LinkedList<Integer> nums = new LinkedList<Integer>();
for(int i = 2;i <= n;i++)
{ //unoptimized
nums.add(i);
}
while(nums.size() > 0)
{
int nextPrime = nums.remove();
for(int i = nextPrime * nextPrime;i <= n;i += nextPrime)
{
nums.removeFirstOccurrence(i);
}
primes.add(nextPrime);
}
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]
Related posts:
Java Program to Generate a Sequence of N Characters for a Given Specific Case
New Features in Java 9
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Sorting Query Results with Spring Data
Java Program to Implement Stack using Two Queues
How to Implement Caching using Adonis.js 5
Spring Boot Annotations
Java Program to Implement Affine Cipher
The Modulo Operator in Java
Mockito and JUnit 5 – Using ExtendWith
Dockerizing a Spring Boot Application
Spring WebClient and OAuth2 Support
Retrieve User Information in Spring Security
Migrating from JUnit 4 to JUnit 5
Template Engines for Spring
XML Serialization and Deserialization with Jackson
Spring AMQP in Reactive Applications
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
Java Program to Perform Searching Using Self-Organizing Lists
Introduction to Spliterator in Java
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Giới thiệu Design Patterns
Java Program to Implement the Edmond’s Algorithm for Maximum Cardinality Matching
Spring Boot - Twilio
Comparing Strings in Java
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Model, ModelMap, and ModelAndView in Spring MVC
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Multi Dimensional ArrayList in Java
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Convert XML to JSON Using Jackson