A more correct title is "most binary search implementations have a bug" but that isn't catchy enough.
When I first saw an article about it, it was actually in the context of how hard it is to write correct code. That should be the take away.
When I first saw an article about it, it was actually in the context of how hard it is to write correct code. That should be the take away.
It's a little disappointing to me that the HN community is more interested in the concrete example than the meta topic itself.