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 Check whether Directed Graph is Connected using BFS
Lớp Collectors trong Java 8
Checked and Unchecked Exceptions in Java
Introduction to Spliterator in Java
Spring Boot - Admin Server
Java – Combine Multiple Collections
Abstract class và Interface trong Java
Documenting a Spring REST API Using OpenAPI 3.0
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
New Features in Java 8
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Spring NoSuchBeanDefinitionException
Using Java Assertions
Sending Emails with Java
Introduction to Spring Cloud OpenFeign
Guide to @JsonFormat in Jackson
Tạo ứng dụng Java RESTful Client với thư viện OkHttp
Spring 5 WebClient
Java Program to Implement Suffix Tree
Unsatisfied Dependency in Spring
Java Program to Implement Brent Cycle Algorithm
Send email with JavaMail
A Guide to the ResourceBundle
Java Program to Implement Repeated Squaring Algorithm
Ép kiểu trong Java (Type casting)
Java – Get Random Item/Element From a List
Java Program to Test Using DFS Whether a Directed Graph is Strongly Connected or Not
Introduction to Java 8 Streams
Ways to Iterate Over a List in Java
Java Program to Implement Quick sort
Sử dụng CountDownLatch trong Java