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 Multi-line String
Giới thiệu Aspect Oriented Programming (AOP)
Mệnh đề if-else trong java
Java Program to Implement Iterative Deepening
Spring Cloud – Tracing Services with Zipkin
Java Program to Implement Segment Tree
Service Registration with Eureka
Vector trong Java
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Java Program to Use Above Below Primitive to Test Whether Two Lines Intersect
Java Program to Implement Randomized Binary Search Tree
Spring Boot - CORS Support
Assert an Exception is Thrown in JUnit 4 and 5
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
String Processing with Apache Commons Lang 3
Comparing Objects in Java
Java Program to implement Sparse Vector
Java Program to Implement a Binary Search Tree using Linked Lists
Spring Security Form Login
Period and Duration in Java
Integer Constant Pool trong Java
Java Program to Implement Double Order Traversal of a Binary Tree
Java Program to Implement Bit Array
A Guide to Java 9 Modularity
The Spring @Controller and @RestController Annotations
Finding Max/Min of a List or Collection
Java Program to Perform Arithmetic Operations on Numbers of Size
Java Program to Implement Gale Shapley Algorithm
HTTP Authentification and CGI/Servlet
Quick Guide to Spring Controllers
Generating Random Dates in Java
Hướng dẫn Java Design Pattern – Bridge