News for hackers. Stuff that matters.
Re:Nearly All Binary Searches and Mergesorts are Broken (2006) by necrecious on Wednesday February 17, 2010 @02:01AM (#1131052)
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.

Re:Nearly All Binary Searches and Mergesorts are Broken (2006) by jpdugan on Wednesday February 17, 2010 @11:18AM (#1131769)
That's my reading, too. The author is really making a point about the fundamental challenge of programming purely logical models in the physical world.

It's a little disappointing to me that the HN community is more interested in the concrete example than the meta topic itself.