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:
Java 8 StringJoiner
Hướng dẫn Java Design Pattern – Memento
Java Program to Emulate N Dice Roller
Spring WebFlux Filters
Java Program to Optimize Wire Length in Electrical Circuit
Spring Security 5 – OAuth2 Login
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Concurrent Test Execution in Spring 5
Java Program to Implement ConcurrentSkipListMap API
Shuffling Collections In Java
Jackson – Marshall String to JsonNode
Constructor Injection in Spring with Lombok
Java InputStream to String
Java Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach
Quick Guide to Spring Bean Scopes
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Spring MVC Content Negotiation
Tạo ứng dụng Java RESTful Client không sử dụng 3rd party libraries
Java Program to Implement Shunting Yard Algorithm
Java Program to Implement Rope
Marker Interface trong Java
Guide to java.util.concurrent.Future
Spring Data JPA @Modifying Annotation
Spring Boot - Tomcat Deployment
Creating a Web Application with Spring 5
Guide to UUID in Java
Java Program to Implement Ford–Fulkerson Algorithm
Autoboxing và Unboxing trong Java
Java Program to Implement Merge Sort Algorithm on Linked List
HttpClient Basic Authentication
Java Program to Implement Stack using Two Queues
Spring Boot - Eureka Server