Joshua Bloch, whose departure can’t have been good for Sun, reports that most divide-and-conquer algorithms—including the binary search in Jon Bentley’s excellent Programming Pearls—are broken because of integer overflow bugs (via Tim Bray): We programmers need all the help we can get, and we should never assume otherwise. Careful design is great. Testing is great. … Continue reading Bentley Overflow Bug