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 Heap’s Algorithm for Permutation of N Numbers
Guava Collections Cookbook
Weak References in Java
Exploring the Spring Boot TestRestTemplate
Introduction to Spring Data MongoDB
Practical Java Examples of the Big O Notation
Command-Line Arguments in Java
Tiêu chuẩn coding trong Java (Coding Standards)
Java Program to Find Median of Elements where Elements are Stored in 2 Different Arrays
Java Program to Implement Cubic convergence 1/pi Algorithm
Getting Started with Forms in Spring MVC
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Constructor Dependency Injection in Spring
Quick Guide to Spring MVC with Velocity
Java Program to Compute Cross Product of Two Vectors
Flattening Nested Collections in Java
Spring @RequestMapping New Shortcut Annotations
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Java Program to Find Basis and Dimension of a Matrix
Hướng dẫn Java Design Pattern – Observer
Jackson vs Gson
Life Cycle of a Thread in Java
Base64 encoding và decoding trong Java 8
Debug a JavaMail Program
Java Program to Implement Meldable Heap
Testing in Spring Boot
The “final” Keyword in Java
Converting Java Date to OffsetDateTime
Show Hibernate/JPA SQL Statements from Spring Boot
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
A Quick Guide to Using Keycloak with Spring Boot
Giới thiệu Aspect Oriented Programming (AOP)