This is a Java Program to Implement Sieve Of Eratosthenes Algorithm. This is a program to find all primes less than a number.
Here is the source code of the Java program to Implement Sieve Of Eratosthenes Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** ** Java Program to implement Sieve Of Eratosthenes **/ import java.util.Scanner; /** Class SieveOfEratosthenes **/ public class SieveOfEratosthenes { /** Function to calculate all primes less than n **/ private int[] calcPrimes(int N) { int[] arr = new int[N + 1]; for (int i = 2; i <= Math.sqrt(N); i++) { if (arr[i] == 0) { for (int j = i * i; j <= N; j += i) { arr[j] = 1; } } } return arr; } /** Function to get all primes **/ public void getPrimes(int N) { int[] primes = calcPrimes(N); display(primes); } /** Function to display all primes **/ public void display(int[] primes) { System.out.print("\nPrimes = "); for (int i = 2; i < primes.length; i++) if (primes[i] == 0) System.out.print(i +" "); System.out.println(); } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Sieve Of Eratosthenes Prime Algorithm Test\n"); /** Make an object of SieveOfEratosthenes class **/ SieveOfEratosthenes soe = new SieveOfEratosthenes(); /** Accept n **/ System.out.println("Enter number to find all primes less than the number\n"); int n = scan.nextInt(); soe.getPrimes(n); } }
Sieve Of Eratosthenes Prime Algorithm Test Enter number to find all primes less than the number 500 Primes = 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499
Related posts:
Introduction to Spring Data REST
Java Program to Search for an Element in a Binary Search Tree
New Features in Java 10
Converting Between a List and a Set in Java
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
Java Program to Generate Random Numbers Using Multiply with Carry Method
A Guide To UDP In Java
Guide to Apache Commons CircularFifoQueue
Why String is Immutable in Java?
Hướng dẫn Java Design Pattern – Flyweight
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Implement Suffix Array
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Working With Maps Using Streams
Logout in an OAuth Secured Application
Mapping Nested Values with Jackson
Java Program to Implement Booth Algorithm
Spring Security Custom AuthenticationFailureHandler
Java Program to Perform integer Partition for a Specific Case
Spring Data – CrudRepository save() Method
Class Loaders in Java
Java Program to Implement Triply Linked List
Spring Boot - Bootstrapping
Java Program to Represent Graph Using Adjacency Matrix
Function trong Java 8
Interface trong Java 8 – Default method và Static method
Java Program to Implement Tarjan Algorithm
Spring MVC Tutorial
New in Spring Security OAuth2 – Verify Claims
Send email with SMTPS (eg. Google GMail)
Java Program to Solve the 0-1 Knapsack Problem
Spring Boot - Scheduling