in reply to Prime Number Finder
Just a thought, but if you were to increment the first for loop by 2, (primes can't be even with the exception of 0 and 2) you only have to calculate half the iterations, making it twice as fast
|
|---|
In Section
Cool Uses for Perl