Performance Example (cont)
What if we want to squeeze even more performance out of it?
Some possibilities:
- don't recompute fixed
sqrt(n) on each iteration
(compute it once before loop, store in variable, use variable in test)
- if a number is even, it's not prime
(add a special test for evens before entering the loop)
- each non-prime odd number has at least one odd factor
(ignore evens, iterate only over the odd numbers in the loop)
|