筛法求素数

筛法求素数

public class test06 {
	static boolean[] isPrime;

	public static void prime(int size) {
		isPrime = new boolean[size + 1];
		isPrime[0] = true;
		isPrime[1] = true;
		for (int i = 2; i <= Math.sqrt(size) + 1; i++) {
			for (int j = i, k = i; j * k <= size; k++) {
				isPrime[j * k] = true;
			}
		}
	}

	public static void main(String[] args) {

	}

}