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:
Tính đóng gói (Encapsulation) trong java
Spring Boot - Interceptor
Mix plain text and HTML content in a mail
Java Program to Implement LinkedBlockingDeque API
Checking for Empty or Blank Strings in Java
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Tiêu chuẩn coding trong Java (Coding Standards)
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Java Program to Implement Interpolation Search Algorithm
Creating a Generic Array in Java
Sử dụng CyclicBarrier trong Java
Java Program to Implement Regular Falsi Algorithm
Basic Authentication with the RestTemplate
Spring Cloud – Tracing Services with Zipkin
Java Program to Implement the One Time Pad Algorithm
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Spring Boot - Admin Server
Interface trong Java 8 – Default method và Static method
Tính trừu tượng (Abstraction) trong Java
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Posting with HttpClient
A Guide to TreeSet in Java
How to use the Spring FactoryBean?
Simple Single Sign-On with Spring Security OAuth2
Query Entities by Dates and Times with Spring Data JPA
Java Program to Compute the Volume of a Tetrahedron Using Determinants
Java Program to Implement Range Tree
Server-Sent Events in Spring
Comparing Long Values in Java
Quick Guide to the Java StringTokenizer
Spring Security Form Login
Java Program to Implement Binary Search Tree