java nextprime,查找下一个质数的最佳方法（Java）

I was asked to write a program to find next prime number in an optimal way. I wrote this code, but I could not find an optimal answer to it. Any suggestions?

public static int nextPrime(int input) {

input++;

//now find if the number is prime or not

for(int i=2;i

if(input % i ==0 ) {

input++;

i=2;

}

else{

continue;

}

}

return input;

}

解决方案

public int nextPrime(int input){

int counter;

input++;

while(true){

int l = (int) sqrt(input);

counter = 0;

for(int i = 2; i <= l; i ++){

if(input % i == 0) counter++;

}

if(counter == 0)

return input;

else{

input++;

continue;

}

}

}

There is no need to check up on input number. It is enough to check up to the square root of a number. Sorry, I didn't remember the theorem name. Here we are incrementing the input for next prime.

The time complexity of this solution O(n^(3/2)).