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:
Java Program to Find a Good Feedback Edge Set in a Graph
Java Program to Implement Shoelace Algorithm
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Java Program to Perform the Shaker Sort
Lập trình đa luồng với CompletableFuture trong Java 8
Iterable to Stream in Java
Java Program to Implement Interval Tree
Converting Strings to Enums in Java
Java Program to Implement HashMap API
Rate Limiting in Spring Cloud Netflix Zuul
Java – String to Reader
Java Program to Permute All Letters of an Input String
Spring Boot - Google OAuth2 Sign-In
An Intro to Spring Cloud Security
Adding a Newline Character to a String in Java
Java Program to Perform Partial Key Search in a K-D Tree
Java Program to Check whether Directed Graph is Connected using BFS
Mockito and JUnit 5 – Using ExtendWith
Java Program to Check Whether an Undirected Graph Contains a Eulerian Cycle
Reversing a Linked List in Java
Java Program to Implement LinkedHashMap API
Spring Boot - Apache Kafka
Java Program to Repeatedly Search the Same Text (such as Bible by building a Data Structure)
Spring Boot Actuator
Request Method Not Supported (405) in Spring
XML Serialization and Deserialization with Jackson
DynamoDB in a Spring Boot Application Using Spring Data
Apache Tiles Integration with Spring MVC
Introduction to Java 8 Streams
Java Program to Implement Uniform-Cost Search
Spring Cloud – Bootstrapping
Concurrent Test Execution in Spring 5