This is a Java Program to Implement Sieve Of Atkin 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 Atkin 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 Atkin Prime generation **/ import java.util.Scanner; /** Class SieveOfAtkin **/ public class SieveOfAtkin { /** Function to calculate all primes less than n **/ private boolean[] calcPrimes(int limit) { /** initialize the sieve **/ boolean[] prime = new boolean[limit + 1]; prime[2] = true; prime[3] = true; int root = (int) Math.ceil(Math.sqrt(limit)); /** put in candidate primes: integers which have an odd number of representations by certain quadratic forms **/ for (int x = 1; x < root; x++) { for (int y = 1; y < root; y++) { int n = 4 * x * x + y * y; if (n <= limit && (n % 12 == 1 || n % 12 == 5)) prime[n] = !prime[n]; n = 3 * x * x + y * y; if (n <= limit && n % 12 == 7) prime[n] = !prime[n]; n = 3 * x * x - y * y; if ((x > y) && (n <= limit) && (n % 12 == 11)) prime[n] = !prime[n]; } } /** eliminate composites by sieving, omit multiples of its square **/ for (int i = 5; i <= root; i++) if (prime[i]) for (int j = i * i; j < limit; j += i * i) prime[j] = false; 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 = "); for (int i = 2; i < primes.length; i++) if (primes[i]) System.out.print(i +" "); System.out.println(); } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Sieve Of Atkin Prime Algorithm Test\n"); /** Make an object of SieveOfAtkin class **/ SieveOfAtkin soa = new SieveOfAtkin(); /** Accept n **/ System.out.println("Enter number to find all primes less than the number\n"); int n = scan.nextInt(); soa.getPrimes(n); } }
Sieve Of Atkin 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 find the maximum subarray sum O(n^2) time(naive method)
Java Program to Implement Queue using Linked List
Consuming RESTful Web Services
Base64 encoding và decoding trong Java 8
Java Byte Array to InputStream
Giới thiệu Swagger – Công cụ document cho RESTfull APIs
How to Define a Spring Boot Filter?
Java Program to Represent Graph Using Incidence List
Spring Data JPA @Modifying Annotation
Using Optional with Jackson
Quick Guide to Spring Controllers
Circular Dependencies in Spring
Java Perform to a 2D FFT Inplace Given a Complex 2D Array
ETags for REST with Spring
Spring Boot - Cloud Configuration Server
What is a POJO Class?
Java Program to Solve the 0-1 Knapsack Problem
A Guide To UDP In Java
Spring Boot - Rest Template
Java Program to Implement Network Flow Problem
Java Program to Perform Searching in a 2-Dimension K-D Tree
Spring Boot - Servlet Filter
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
Java Program to find the peak element of an array using Binary Search approach
Java Program to Implement Extended Euclid Algorithm
Spring Boot - Service Components
Tổng quan về ngôn ngữ lập trình java
Spring Boot Change Context Path
Spring Boot Annotations
Java Program to Implement Miller Rabin Primality Test Algorithm
How to Read HTTP Headers in Spring REST Controllers
Adding Parameters to HttpClient Requests