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 Implement Graph Coloring Algorithm
Spring Boot Change Context Path
HttpClient Connection Management
Removing all Nulls from a List in Java
Getting Started with Forms in Spring MVC
Mockito and JUnit 5 – Using ExtendWith
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Java 9 Stream API Improvements
Exception Handling in Java
Server-Sent Events in Spring
ExecutorService – Waiting for Threads to Finish
Inject Parameters into JUnit Jupiter Unit Tests
Converting Between Byte Arrays and Hexadecimal Strings in Java
Prevent Brute Force Authentication Attempts with Spring Security
Spring Cloud – Adding Angular
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Introduction to Thread Pools in Java
Java Program to Find Nearest Neighbor for Static Data Set
The DAO with JPA and Spring
Hướng dẫn Java Design Pattern – Transfer Object
Java Program to Implement Ternary Search Tree
Java Program to Implement Knapsack Algorithm
Java Program to Perform Matrix Multiplication
Automatic Property Expansion with Spring Boot
Add Multiple Items to an Java ArrayList
A Quick JUnit vs TestNG Comparison
Java Program to Implement LinkedTransferQueue API
String Initialization in Java
Java Program to Implement Solovay Strassen Primality Test Algorithm
Java Program to Implement Weight Balanced Tree
Test a REST API with Java
Java Program to Implement Hash Tables