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:
Extract network card address
An Intro to Spring Cloud Contract
Spring Boot - Tracing Micro Service Logs
Adding a Newline Character to a String in Java
Custom HTTP Header with the HttpClient
Weak References in Java
Spring Boot - Eureka Server
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Java Program to Implement Stack API
Lập trình đa luồng với CompletableFuture trong Java 8
Java Program to Find Maximum Element in an Array using Binary Search
Exploring the New Spring Cloud Gateway
Java Program to Implement Brent Cycle Algorithm
An Intro to Spring Cloud Security
Introduction to Spring Cloud Rest Client with Netflix Ribbon
Jackson – Change Name of Field
Java Program to Solve a Matching Problem for a Given Specific Case
Java Program to Implement Fibonacci Heap
How To Serialize and Deserialize Enums with Jackson
Spring Boot - Internationalization
Automatic Property Expansion with Spring Boot
Documenting a Spring REST API Using OpenAPI 3.0
Java Program to Find the Mode in a Data Set
Java Program to Implement Booth Algorithm
Java Program to Optimize Wire Length in Electrical Circuit
Get the workstation name or IP
Intersection of Two Lists in Java
Use Liquibase to Safely Evolve Your Database Schema
Comparing Two HashMaps in Java
Java Program to Solve any Linear Equation in One Variable
Java Program to Implement Stack
Remove the First Element from a List