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:
Guava CharMatcher
Logout in an OAuth Secured Application
The Spring @Controller and @RestController Annotations
Java Program to Find All Pairs Shortest Path
Java 8 StringJoiner
Java Program to Implement Stein GCD Algorithm
Java Collections Interview Questions
Java Program to Describe the Representation of Graph using Incidence List
Java InputStream to String
Java Program to Implement Sorted Vector
DynamoDB in a Spring Boot Application Using Spring Data
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Java Program to Check if a Given Graph Contain Hamiltonian Cycle or Not
HashSet trong java
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Static Content in Spring WebFlux
Getting Started with GraphQL and Spring Boot
Java Program to Implement PrinterStateReasons API
Hướng dẫn Java Design Pattern – Decorator
Testing an OAuth Secured API with Spring MVC
Request a Delivery / Read Receipt in Javamail
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Guide to java.util.concurrent.Future
Optional trong Java 8
Spring Boot - Sending Email
Spring Boot - Google OAuth2 Sign-In
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Guide to UUID in Java
Java Program to Solve Travelling Salesman Problem for Unweighted Graph
Java Program to Implement WeakHashMap API
Java Program to Implement Best-First Search
Java Program to Implement Sorted Circular Doubly Linked List