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:
Spring Cloud AWS – RDS
Hướng dẫn Java Design Pattern – Memento
Java Program to Implement Gauss Jordan Elimination
Java Program to Implement Pairing Heap
Split a String in Java
Hướng dẫn Java Design Pattern – Abstract Factory
Converting a List to String in Java
Remove the First Element from a List
Java Program to Create a Balanced Binary Tree of the Incoming Data
How to Read HTTP Headers in Spring REST Controllers
A Guide to the Java LinkedList
Spring Boot Gradle Plugin
Spring Boot: Customize the Jackson ObjectMapper
Practical Java Examples of the Big O Notation
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Test a REST API with Java
Introduction to Spring MVC HandlerInterceptor
Spring Boot - Rest Controller Unit Test
Java Program to Implement Attribute API
Introduction to Spring Data MongoDB
Custom Cascading in Spring Data MongoDB
Spring Boot - Application Properties
Java Program to Implement Patricia Trie
Java Program to implement Sparse Vector
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Spring’s RequestBody and ResponseBody Annotations
Java 8 Stream findFirst() vs. findAny()
Recommended Package Structure of a Spring Boot Project
Introduction to Java 8 Streams
How to Count Duplicate Elements in Arraylist
Java Program to Implement Max-Flow Min-Cut Theorem
Java Program to Implement Gabow Algorithm