使用Java位集BitSet查找素数
public class sieve{
public static void main(String[] args){
int n = 2000;
BitSet b = new BitSet(n + 1);
int count = 0;
int i;
for(i = 2;i <= n;i++){
b.set(i);
}
i = 2;
while(i * i <= n){
if (b.get(i)){
count++;
System.out.println(i);
int k = i * 2;
while(k <= n){
b.clear(k);
k += i;
}
}
i++;
}
while(i <= n){
if(b.get(i)){
count++;
System.out.println(i);
}
i++;
}
System.out.println(count + “ primes”);
}
}