package primenumber;

import java.util.List;

/**
 * Tester class to test prime number algorithms
 * @author Winston   Prakash
 */
public class PrimeNumberTester {
 
    public static void main(String[] args) {
        PrimeNumber primeNumber = new PrimeNumber();
        List<Integer> primeNumbers1 = primeNumber.bruteForce(0, 100000);
        System.out.println("No of primes found - " + primeNumbers1.size()); 
        
        List<Integer> primeNumbers = primeNumber.byElimination(10000);
        System.out.println("No of primes found - " + primeNumbers.size()); 
        long count = 0;
        for(Integer  primes : primeNumbers){
            if((count++ % 10) == 0){
               System.out.println(); 
            }
            System.out.print(primes + "  ");
        }
        
        long number = 999671L;
        //long number = 999149L;
        //long number = 885389L;
        //long number = 3209L;
        System.out.println("Is " + number + " a prime number? - " + primeNumber.isPrimeBruteForce(number)); 
        System.out.println("Is " + number + " a prime number? - " + primeNumber.isPrimeQuick(number)); 
    }
    
}