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 – Rename or Move a File
Reactive WebSockets with Spring 5
Java Program to Implement Double Order Traversal of a Binary Tree
Guide to @ConfigurationProperties in Spring Boot
Java Program to Find a Good Feedback Vertex Set
Spring Security 5 – OAuth2 Login
Java Program to Implement Segment Tree
Spring Boot - Tomcat Deployment
Java Program to Generate a Random Subset by Coin Flipping
Java Program to Implement Flood Fill Algorithm
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
Interface trong Java 8 – Default method và Static method
Hướng dẫn tạo và sử dụng ThreadPool trong Java
Java Program to Implement Queue
Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree
Java Program to Sort an Array of 10 Elements Using Heap Sort Algorithm
Spring Boot - Scheduling
Java Program to Implement the Hungarian Algorithm for Bipartite Matching
Java Program to Implement Ford–Fulkerson Algorithm
Adding Parameters to HttpClient Requests
Java Program to implement Bit Set
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Hướng dẫn Java Design Pattern – Builder
Java Program to Implement Shell Sort
Java Program to Represent Linear Equations in Matrix Form
Java Program to Check the Connectivity of Graph Using DFS
Java Program to Perform Right Rotation on a Binary Search Tree
A Guide to WatchService in Java NIO2
Java Program to Perform Left Rotation on a Binary Search Tree
Spring Boot - Rest Template
How to Convert List to Map in Java
Static Content in Spring WebFlux