This is a Java Program to Implement Sieve Of Sundaram 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 Sundaram 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 Sundaram Prime generation
**/
import java.util.Scanner;
/** Class SieveOfSundaram **/
public class SieveOfSundaram
{
/** Function to calculate all primes less than n **/
private boolean[] calcPrimes(int limit)
{
int n = limit/2;
/** initialize the sieve **/
boolean[] prime = new boolean[limit];
for (int i = 1; i < n; i++)
for (int j = i; j <= (n - i) / (2 * i + 1); j++)
prime[i + j + 2 * i * j] = true;
return prime;
}
/** Function to get all primes **/
public void getPrimes(int N)
{
boolean[] primes = calcPrimes(N);
display(primes);
}
/** Function to display all primes **/
public void display(boolean[] primes)
{
System.out.print("\nPrimes = 2 3 ");
for (int i = 2; i < primes.length/2; i++)
if (!primes[i])
System.out.print((2 * i + 1) +" ");
System.out.println();
}
/** Main function **/
public static void main (String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("Sieve Of Sundaram Prime Algorithm Test\n");
/** Make an object of SieveOfSundaram class **/
SieveOfSundaram sos = new SieveOfSundaram();
/** Accept n **/
System.out.println("Enter number to find all primes less than the number\n");
int n = scan.nextInt();
sos.getPrimes(n);
}
}
Output:
Sieve Of Sundaram 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 Boot Actuator
Java Program to Perform LU Decomposition of any Matrix
Phương thức forEach() trong java 8
Returning Custom Status Codes from Spring Controllers
Spring Boot - Eureka Server
Java 8 Collectors toMap
Using Spring @ResponseStatus to Set HTTP Status Code
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Lớp LinkedHashMap trong Java
Java Program to Describe the Representation of Graph using Adjacency Matrix
How to Get All Dates Between Two Dates?
Java Program to Implement the linear congruential generator for Pseudo Random Number Generation
Checked and Unchecked Exceptions in Java
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Introduction to the Java NIO2 File API
Java Program to add two large numbers using Linked List
Spring RequestMapping
Spring Cloud Bus
Spring Cloud – Adding Angular
Java Convenience Factory Methods for Collections
Feign – Tạo ứng dụng Java RESTful Client
LinkedList trong java
How to Define a Spring Boot Filter?
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Enum trong java
Spring Boot - Scheduling
Hướng dẫn Java Design Pattern – Null Object
Giới thiệu Aspect Oriented Programming (AOP)
Java Program to Find Whether a Path Exists Between 2 Given Nodes
Java equals() and hashCode() Contracts
Summing Numbers with Java Streams