package edu.ups.parallel.test;

import java.util.Calendar;
import java.util.Random;

public class PrimeTest {
	public static void main( String[] args ) {
		PrimeTest pt = new PrimeTest( 1000000 );
	}
	public PrimeTest( long nPrimes ) {
		Calendar start = Calendar.getInstance();

		long i = 0;
		boolean[] isPrime = new boolean[ (int) nPrimes ];
		long[] numbers = new long[ (int) nPrimes ];
		parallel for( i = 0; i < nPrimes; i++ ) {
			numbers[ (int) i ] = i;
			isPrime[ (int)i ] = isPrime( i );
		}

		Calendar end = Calendar.getInstance();
		System.out.println( end.getTimeInMillis() - start.getTimeInMillis() + " ms");
	}

	public boolean isPrime( long p ) {
		long sqrt = (long) Math.sqrt( (double)p );
		for( int k = 2; k < sqrt+1; k++ ) {
			if( p % k == 0 ) {
				return false;
			}
		}
		return true;
	}
}