Re:Nearly All Binary Searches and Mergesorts are Broken (2006)
by ScottBurson on Thursday July 09, 2015 @06:42PM
(#9861173)
Sometimes you specifically want arithmetic modulo 2^32 (or some other word length). This comes up in cryptography, for example.
[ Parent
| on HN ]
There are no comments on this comment yet.