Maybe not the point of your post, but that is one dumb algorithm for finding primes.
Why test even numbers greater than 2? Why test multiples of the primes already found? Why trial divide with Xs greater than sqrt(n)?
In reply to Re: Perl vs. Python for prime numbers
by BrowserUk
in thread Perl vs. Python for prime numbers
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |