Search found 2 matches

Oh and I found a few trivial bugs. First, you store the current divider in q[i] for use later, but then overwrite it with the bool indicating if it is a prime. Second, in the first block in the loop, ...

Looks very good! Personally think it could need some comenting, though...

Also, you should replace

r = n / q;
if ( n == r * q ) return false;

with

if ( n ? q == 0 ) return ...