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:
Performance Difference Between save() and saveAll() in Spring Data
Spring Boot: Customize the Jackson ObjectMapper
Java Program to implement Sparse Vector
Custom Cascading in Spring Data MongoDB
Java Program to Implement Euler Circuit Problem
Spring Boot - Sending Email
Java Program to Implement vector
4 tính chất của lập trình hướng đối tượng trong Java
Java Program to Check if a Directed Graph is a Tree or Not Using DFS
Ways to Iterate Over a List in Java
Java 8 Streams peek() API
Guide to java.util.concurrent.Locks
Java Program to Implement the Program Used in grep/egrep/fgrep
Spring Boot - Admin Client
Java Program to Implement Cubic convergence 1/pi Algorithm
Java Program to Construct a Random Graph by the Method of Random Edge Selection
Create a Custom Exception in Java
Join and Split Arrays and Collections in Java
Life Cycle of a Thread in Java
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Apache Commons Collections MapUtils
Java Program to Find a Good Feedback Vertex Set
Spring Boot - Admin Server
Creating Docker Images with Spring Boot
Spring Boot Tutorial – Bootstrap a Simple Application
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm
Java Deep Learning Essentials - Yusuke Sugomori
Reactive WebSockets with Spring 5
Spring Boot - Application Properties
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Spring Data JPA and Null Parameters
Java Program to Implement VList