Re:Faster remainders when the divisor is a constant: beating...
by mark-r on Friday February 08, 2019 @11:33PM
(#19120746)
For modern processors you can assume that a couple of instructions will be much faster than a memory lookup. Even if the lookup is cached it will most likely push something else important out of cache.
[ Parent
| on HN ]
There are no comments on this comment yet.