找出质数算法之四

public class Eratosthenes算法 {

public static void main(String[] args) {
int n = 27;

int[] primes= new int[n+1];

for (int k = 2; k <= n/k; k++) {
if (primes[k]==0) {
for (int i = k; i <= n/k; i++) {
System.out.println(k+"*"+i);
primes[k*i] = 1;
}
}
}

int count = 0;
System.out.println("素数是:");

for (int number = 2; number < primes.length; number++) {
if (primes[number] == 0){
count++;
//System.out.println(number);
}

}

System.out.println("\n一共有" + count + "个");
}
}