privatestaticvoid test(int i) { boolean isPrime =true;// 榛樿鏄川鏁?/span> if (i <2) {
System.out.println("姹傝川鏁拌寖鍥磋繃灝忋傘傘傘傘傘?/span>"); return;
}
System.out.print("2 ,"); for (int j =3; j <= i; j++) {
isPrime =true;
if (j %2==1) { // 濡傛灉鏄ぇ浜?鐨勫鏁?/span> for (int k =3; k * k < j; k++) { if (j % k ==0) {
isPrime =false; break;
}
} if (isPrime) {
System.out.print(j +" ,");
}
}
}
}
for (int j =2; j <= i; j++) { int k =2; boolean isPrime =true; while (k * k < j) { // can be devided by k,so begin with 2 if (j % k ==0) {
isPrime =false; break;
} else {
k++;
}