3 ms·
Wouldn't it in fact be a lot slower using an integer? Lots of divisions by 10, instead of just adding every byte.
by boring_twenties 6y ago
Wouldn't it in fact be a lot slower using an integer? Lots of divisions by 10, instead of just adding every byte.
- userbinator 6y agohttps://en.wikipedia.org/wiki/Luhn_algorithm https://en.wikipedia.org/wiki/Luhn_algorithm There's exactly one division required. (Implementing it using vector instructions is left as an exercise for the reader. A very elementary exercise, so I encourage you to try it if you're curious about SSE and such.)
- Arnavion 6y agoLuhn's algorithm works on a digit string, not a single integer.
- im3w1l-alt 6y agoChecking divisibility by a known constant can be done in a better way than doing a division. https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ https://lemire.me/blog/2019/02/08/faster-remainders-when-the...