Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by Iv on Saturday July 23, 2016 @01:44AM
(#12148515)
A more interesting version of that bug, I find, and the reason why I almost never used unsigned values in my algorithm is that when you compute indices in a non-trivial way, any intermediate value that is negative will break your program.
[ Parent
| on HN ]
There are no comments on this comment yet.