Anonymous user
Ascending primes: Difference between revisions
→{{header|Java}}
Line 712:
private boolean isPrime(int value) {
if (value ==
return false;
int root = (int)
if (value % k == 0) {
return false;
}
▲ for (int k = 3; k <= root; k += 2)
▲ if (value % k == 0) {
▲ return false;
▲ }
}
return true;
|