Re:Nearly All Binary Searches and Mergesorts are Broken (2006)
by wingo on Wednesday February 17, 2010 @05:14AM
(#1131242)
If Perlis was right when he said that Lispers know the value of everything and the cost of nothing, this bug proves the counterpoint: of Fortran-derived languages knowing the cost of everything but the value of, um, most things but not some others.
Not quite as eloquent, is it?
But this has nothing do do with binary search or mergesort.
Regardless of our opinions of overflow, it exists in many languages. And I cannot think of anything that would better qualify this issue for "has something to do with binary search" status than that most programmers have seen, used, or written an implementation with this bug.