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:
Array to String Conversions
Spring Boot - Enabling HTTPS
Overview of the java.util.concurrent
Java Program to Check if a Point d lies Inside or Outside a Circle Defined by Points a, b, c in a Pl...
Java Program to Implement Adjacency Matrix
Check If a File or Directory Exists in Java
Java Program to Implement Range Tree
Getting Started with Custom Deserialization in Jackson
Guide to Apache Commons CircularFifoQueue
Reversing a Linked List in Java
Simplify the DAO with Spring and Java Generics
Adding Shutdown Hooks for JVM Applications
Logout in an OAuth Secured Application
Java – Try with Resources
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
Lớp TreeMap trong Java
Giới thiệu Google Guice – Injection, Scope
Spring Security 5 – OAuth2 Login
An Intro to Spring Cloud Contract
Các nguyên lý thiết kế hướng đối tượng – SOLID
Concurrent Test Execution in Spring 5
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Java Program to Implement Dijkstra’s Algorithm using Queue
Hướng dẫn Java Design Pattern – Chain of Responsibility
OAuth2.0 and Dynamic Client Registration
Java Program to Implement ArrayDeque API
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Quick Guide on Loading Initial Data with Spring Boot
Java Program to Perform Addition Operation Using Bitwise Operators
Reading an HTTP Response Body as a String in Java
Mapping a Dynamic JSON Object with Jackson
Java Program to Solve any Linear Equations