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:
Guide to Guava Table
Introduction to Netflix Archaius with Spring Cloud
Java Program to Implement Heap
Using a Mutex Object in Java
Java Collections Interview Questions
Guide to Java Instrumentation
Sort a HashMap in Java
Intro to the Jackson ObjectMapper
Servlet 3 Async Support with Spring MVC and Spring Security
Java Program to Implement Hash Trie
Java Program to Implement Self Balancing Binary Search Tree
Java Program to Implement the Checksum Method for Small String Messages and Detect
Spring Security with Maven
Java Program to Generate All Pairs of Subsets Whose Union Make the Set
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Period and Duration in Java
The XOR Operator in Java
Java Program to Implement Double Order Traversal of a Binary Tree
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Serverless Functions with Spring Cloud Function
Sao chép các phần tử của một mảng sang mảng khác như thế nào?
Java Program to Implement Double Ended Queue
Spring Security 5 for Reactive Applications
Spring Security OAuth2 – Simple Token Revocation
Hướng dẫn Java Design Pattern – Transfer Object
Versioning a REST API
Spring Boot - Cloud Configuration Server
Java Program to Implement Maximum Length Chain of Pairs
Java Streams vs Vavr Streams
Supplier trong Java 8
Multi Dimensional ArrayList in Java
Java Program to Implement LinkedBlockingQueue API