Written in C++ and this check's if a number is prime. It's really simple, and it returns '0' if it's prime or '1' if it's not prime.
Wondering if anyone can make this more efficient?
PHP Code:
int IS_prime(double num)
{
int isprime = 0;
for(int i = 2; i <= sqrt(num); i += 2)
{
if(i % 2 == 0)
i++;
if((int(num)% i) == 0)
{
isprime = 1;
break;
}
}
return isprime;
}
__________________