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:
ETags for REST with Spring
REST Web service: Basic Authentication trong Jersey 2.x
Java Program to Implement Repeated Squaring Algorithm
Java Program to Implement Stack using Linked List
Serve Static Resources with Spring
Java Program to Implement Bellman-Ford Algorithm
Java Program to Implement Heap’s Algorithm for Permutation of N Numbers
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Guide to BufferedReader
Understanding Memory Leaks in Java
Java – Try with Resources
Convert XML to JSON Using Jackson
Một số ký tự đặc biệt trong Java
Introduction to Thread Pools in Java
Java – Convert File to InputStream
Encode/Decode to/from Base64
So sánh HashMap và Hashtable trong Java
File Upload with Spring MVC
Java Program to Implement Interval Tree
Giới thiệu java.io.tmpdir
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Java Program to Implement Horner Algorithm
Creating a Generic Array in Java
Lấy ngày giờ hiện tại trong Java
More Jackson Annotations
Java Program to implement Associate Array
Java Program to Implement Queue
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Login For a Spring Web App – Error Handling and Localization
Giới thiệu Aspect Oriented Programming (AOP)
Java Streams vs Vavr Streams
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular