java isprime函数,Java - isPrime函数

This is my isPrime

private static boolean isPrime(int num) {

if (num % 2 == 0) return false;

for (int i = 3; i * i < num; i += 2)

if (num % i == 0) return false;

return true;

}

I put isPrime(9) and it returns true. What is wrong with the function?

解决方案

Your condition should be i * i <= num

private static boolean isPrime(int num) {

if (num < 2) return false;

if (num == 2) return true;

if (num % 2 == 0) return false;

for (int i = 3; i * i <= num; i += 2)

if (num % i == 0) return false;

return true;

}

You didn't take number 9 in your consideration so 9<9 will result false. But you need to check 9.