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 Find Nearest Neighbor for Dynamic Data Set
Quick Guide to the Java StringTokenizer
Java Program to implement Priority Queue
Hướng dẫn sử dụng Lớp FilePermission trong java
Spring Boot - Admin Client
Get the workstation name or IP
Java Program to Implement Sorting of Less than 100 Numbers in O(n) Complexity
Generate Spring Boot REST Client with Swagger
Jackson Annotation Examples
Find the Registered Spring Security Filters
Simultaneous Spring WebClient Calls
So sánh HashMap và HashSet trong Java
Java Program to Implement Gauss Seidel Method
Java Program to find the number of occurrences of a given number using Binary Search approach
List Interface trong Java
Spring 5 and Servlet 4 – The PushBuilder
Java Program to Solve a Matching Problem for a Given Specific Case
Create Java Applet to Simulate Any Sorting Technique
Spring WebClient Filters
Lớp Collectors trong Java 8
Java Program to Implement Queue using Linked List
The Order of Tests in JUnit
Guide to @ConfigurationProperties in Spring Boot
Quick Guide to Spring MVC with Velocity
Java Collections Interview Questions
A Guide to WatchService in Java NIO2
Java Program to Compute Determinant of a Matrix
Java Scanner hasNext() vs. hasNextLine()
Spring MVC Async vs Spring WebFlux
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Spring Boot - Sending Email
Finding Max/Min of a List or Collection