The point of my post was that if you know you are summing 1 .. N then don't - use the formula. Programmer knowledge of the specific problem beats a generalization.
Cheers - L~R
In reply to Re^5: &1 is no faster than %2 when checking for oddness. Oh well.
by Limbic~Region
in thread &1 is no faster than %2 when checking for oddness. Oh well.
by diotalevi
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |