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:
Logout in an OAuth Secured Application
Converting a List to String in Java
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Implement RoleUnresolvedList API
Life Cycle of a Thread in Java
Làm thế nào tạo instance của một class mà không gọi từ khóa new?
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
Quick Guide to the Java StringTokenizer
Java Program to Find Number of Articulation points in a Graph
JWT – Token-based Authentication trong Jersey 2.x
Java Program to Implement Meldable Heap
The HttpMediaTypeNotAcceptableException in Spring MVC
Converting between an Array and a List in Java
New Features in Java 15
Lấy ngày giờ hiện tại trong Java
Giới thiệu JDBC Connection Pool
Java Program to Implement Euclid GCD Algorithm
Marker Interface trong Java
Spring MVC Async vs Spring WebFlux
Using a Spring Cloud App Starter
Loại bỏ các phần tử trùng trong một ArrayList như thế nào?
Hướng dẫn sử dụng Java Annotation
Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon
HttpClient Timeout
Java Program to Implement HashSet API
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Guide to Apache Commons CircularFifoQueue
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Java Program to Implement Gift Wrapping Algorithm in Two Dimensions
The XOR Operator in Java
A Guide to HashSet in Java
Spring Data JPA @Query