讲述O(n)筛法求素数的经典论文 ---------- A Linear Sieve Algorithm for Finding Prime Numbers David Gries Cornell University Jayadev Misra University of Texas at Austin
筛法里面循环的下标很烦
需要debug很长时间
可以尝试一下定义变量代替下标
public class Week2_2 {
public static void main(String[] args) {
int RANGE=100;
boolean[] booleans = new boolean[RANGE];
for (int i = 0; i <RANGE ; i++) {
booleans[i]=tr
