Sieve Of Eratosthenes


Download jar file or use maven. psjava requires Java 1.6 (or above)


Example Code

// Select sieve algorithm, and just call it.

PrimeNumberSieve sieve = SieveOfEratosthenes.getInstance();
Array<Integer> primes = sieve.calcList(30);

int number = primes.size(); // there are 10 primes. between [1~30]
int prime1st = primes.get(0); // first prime is 2
int prime8th = primes.get(7); // 8th prime is 19


Copyright 2014 psjava team. View on GitHub