素数筛选法java实现

package cn.geosis.prime;

import java.util.Scanner;
/**
 * @author Administrator
 * 2013—9-22
 * 1~N内的素数筛选法
 * 1、奇数赋值为true
 * 2、奇数中从3开始到根号N，是其倍数的都置为false
 * 3、输出奇数中任然为true的数组下标，下标即为素数
 * 注意：java数组的下标是从0开始的，需要将N扩展一位到N+1
 */


public class Prime {


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("请输入数值：");
Scanner scanner=new Scanner(System.in);
final int NumberRange=scanner.nextInt()+1;
long startTime=System.currentTimeMillis();
boolean[] prime=new boolean[NumberRange];

for (int i = 1; i < prime.length; i++) {
if (i%2==1) {
prime[i]=true;
} 
}
for (int i = 1; i < prime.length; i++) {
System.out.println(prime[i]);
}
for (int i = 3; i < (long)Math.ceil(Math.sqrt((double)NumberRange)); i+=2) {
if (prime[i]) {
for (int j = 2*i; j < NumberRange;j+=i) {
prime[j]=false;
}

}

}
for (int i = 3; i < prime.length; i+=2) {
if (prime[i]) {
System.out.println(i);

}
}
long endTime=System.currentTimeMillis();
System.out.println("程序运行时间： "+(endTime-startTime)+"ms");

}


}