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:
CyclicBarrier in Java
Consumer trong Java 8
Java Program to Use Dynamic Programming to Solve Approximate String Matching
Java Program to Find Number of Articulation points in a Graph
Mockito and JUnit 5 – Using ExtendWith
Java Program to Perform Deletion in a BST
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Removing Elements from Java Collections
Java Program to implement Priority Queue
Java Program to find the number of occurrences of a given number using Binary Search approach
Object cloning trong java
Introduction to Spring Cloud Stream
Hướng dẫn Java Design Pattern – Composite
Changing Annotation Parameters At Runtime
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Guava CharMatcher
Hướng dẫn Java Design Pattern – Singleton
Hashtable trong java
A Guide to TreeSet in Java
Hướng dẫn Java Design Pattern – Interpreter
Hướng dẫn Java Design Pattern – DAO
Spring Boot - Unit Test Cases
Supplier trong Java 8
Java Program to Implement Shunting Yard Algorithm
Comparing Arrays in Java
Spring Boot - Servlet Filter
Java Collections Interview Questions
Introduction to Spliterator in Java
Java Program to Solve the Fractional Knapsack Problem
The “final” Keyword in Java
4 tính chất của lập trình hướng đối tượng trong Java
Java Program to Implement RenderingHints API