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 Check the Connectivity of Graph Using DFS
JWT – Token-based Authentication trong Jersey 2.x
Java Program to Decode a Message Encoded Using Playfair Cipher
Java Program to Create the Prufer Code for a Tree
Java Program to Implement Double Ended Queue
Java Program to Implement Double Order Traversal of a Binary Tree
Java 8 Streams peek() API
Base64 encoding và decoding trong Java 8
Java Program to Solve a Matching Problem for a Given Specific Case
Quick Guide to Spring Bean Scopes
Java Program to Implement Shoelace Algorithm
Java 8 Collectors toMap
Java Program to Check if a Matrix is Invertible
Java Program to Construct a Random Graph by the Method of Random Edge Selection
Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
Java Program to Implement Sorted List
Java Program to Implement Cartesian Tree
Java Program to Show the Duality Transformation of Line and Point
Java Program to Implement the Monoalphabetic Cypher
Java Program to Perform Preorder Non-Recursive Traversal of a Given Binary Tree
An Intro to Spring Cloud Zookeeper
Hướng dẫn tạo và sử dụng ThreadPool trong Java
Spring Boot - Exception Handling
Java Program to Implement Find all Forward Edges in a Graph
Consumer trong Java 8
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Runnable vs. Callable in Java
Java Program to Implement Trie
OAuth2 Remember Me with Refresh Token
Java Program to Perform Insertion in a BST
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm
Handle EML file with JavaMail