Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by mshenfield on Friday July 22, 2016 @10:05PM
(#12148026)
One possible scenario is he proved it correct assuming that the ints in the function were mathematical integers(-infinity, ... -1, 0, 1, ..., infinity). In realty all representations of numbers have an upper limit after which the representation will become corrupted or unsupported.
[ Parent
| on HN ]
There are no comments on this comment yet.