判断素数 is_prime()

1.donnot use this if x is very large or small

int is_prime(int x)

{

int i;

for(i = 2;i * i <= x;i++)

{

if(x%i == 0) return 0;

}

return 1;

}

2.better way

int is_prime(int x)

{

int i,m;

assert(x >= 0);

if(x == 1) return 0;

m = floor(sqrt(x) + 0.5);

for(i = 2;i <= m;i++)

{

if(x%i == 0) return 0;

}

return 1;

}