Ben*_*nny -1 java algorithm primes
我想显示用户所需的素数.例如,如果用户想要第3个素数,我将显示5.我有以下java代码.
import java.util.Scanner;
public class Prime {
private static Scanner scanner;
public static void main(String args[]) {
//get input till which prime number to be printed
// System.out.println("Enter which prime number to be printed: ");
// scanner = new Scanner(System.in);
// int limit = scanner.nextInt();
int count = 0;
int number = 2;
//System.out.println("Printing prime number from 1 to " + limit);
while(count<=3)
{
if(isPrime(number)){
count++;
// System.out.println(count);
}
number++;
}
if(count == 3)
System.out.println("10001 prime is "+number);
}
public static boolean isPrime(int number){
for(int i=2; i<number; i++){
if(number%i == 0){
return false;
}
}
return true;
}
}
Run Code Online (Sandbox Code Playgroud)
当我运行它时,我无法获得任何输出.我哪里错了?PS:暂时,我只运行循环直到3.