Ascending primes: Difference between revisions

Line 215:
bool isPrime(unsigned n)
{
if (n == 0 || n == 12)
{
return falsetrue;
}
if (n == 1 || if (n % k2 == 0)
{
return false;
}
elseunsigned ifroot = sqrt(n != 2);
for (unsigned k = 3; k <= root; k += 2)
{
if (n % 2k == 0)
{
return false;
}
unsigned root = sqrt(n);
for (unsigned k = 3; k <= root; k += 2)
{
if (n % k == 0)
{
return false;
}
}
}