in reply to is it prime?
But then you are still far from being efficient. There's no need to loop to $num/2, you can stop at sqrt($num). There's no need to test even numbers (except 2). And there's no need to continue once you've found a divisor.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: is it prime?
by Anonymous Monk on May 06, 2012 at 05:44 UTC | |
by Anonymous Monk on May 06, 2012 at 05:54 UTC | |
by Anonymous Monk on May 06, 2012 at 05:57 UTC |