This snippet will do a brute force algorithm to solve prime numbers to a specified number.
nt counter = 0;
long startTime = System.nanoTime();
for(int a = 1; a <= 10000; a++)
{
int factor = 0;
int primetest = 1;
while(primetest <= a)
{
if(a % primetest == 0)
{
factor++;
}
primetest++;
}
if (factor == 2)
{
System.out.println(a);
counter++;
}
}
long endTime = System.nanoTime();
System.out.println("Took "+(endTime - startTime) + " ns");
System.out.println("There are: " + counter + "total primes");