There has to be a better way,
May 10, 2007 at 3:08 PM
This is a very simple implementation of a prime number check. I feel checking every single divisor of a number to verify its primality is sort of 'brute force' is there a more elegant way to do this?
View All Comments
| View Tutorial