package com.algorithm;
/**
* describe: 素数判断
* create on: 2011-05-25
* @author sylor.liu
* @version 1.0
* @since jdk1.6
*/
public class Prime {
// 判断该数字是否为素数
public static boolean isPrimes(int num){
if(num <= 1){
return false;
}
boolean flag = true;
int sqrtNum = (int)Math.sqrt(num);
for (int i = 2; i <= sqrtNum; i++) {
if(num%i == 0){
flag = false;
break;
}
}
return flag;
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
for (int i = 0; i < 100; i++) {
if(Prime.isPrimes(i)){
System.out.print(i + " ;");
}
}
System.out.println();
}
}