鐃緒申鐃緒申郎鐃緒申鐃緒申箸鐃緒申鐃粛鰹申如鐃�

Official Google Research Blog: Extra, Extra - Read All About It: Nearly All Binary Searches and Mergesorts are Broken
The bug is in this line: 
 6:             int mid =(low + high) / 2;

鐃淑わ申箸鐃緒申鐃緒申鐃緒申泙淵丱鐃緒申鐃�

鐃緒申典的鐃出ワ申鐃淑リサ鐃緒申鐃緒申鐃緒申鐃暑ゴ鐃所ズ鐃緒申縫丱鐃�: 鐃循ットワ申鐃緒申鐃淑￥申鐃緒申鐃緒申鐃緒申裏
鐃緒申鐃縮わ申鐃緒申鐃緒申鐃緒申鐃祝なわ申覆鐃緒申鐃叔わ申鐃緒申鐃緒申鐃殉のほとわ申匹離泪鐃緒申鐃熟￥申int鐃緒申32bit鐃緒申鐃緒申鐃初、鐃緒申鐃塾ワ申鐃暑ゴ鐃所ズ鐃緒申如鐃�2 ^ 31 - 1鐃夙わ申鐃緒申int鐃塾削申鐃緒申鐃粛わ申超鐃緒申鐃緒申茲�鐃緒申 鐃緒申鐃夙はなわ申鐃緒申鐃初。

鐃緒申鐃緒申辰醗磴わ申泙鐃緒申鐃�n >= (MAX_INT/2 + 1)鐃緒申n鐃淑わ申発鐃緒申鐃緒申鐃殉わ申鐃処。

鐃緒申鐃緒申鐃叔￥申MAX_INT鐃緒申 0x7FFFFFFF鐃緒申鐃緒申鐃緒申半分+1鐃緒申0x40000000鐃緒申鐃夙わ申鐃緒申鐃緒申鐃夙わ申low = high = 0x40000000 鐃塾誌申鐃緒申low + high = 0x80000000鐃緒申鐃夙わ申鐃緒申鐃緒申鐃緒申鐃緒申鐃�-0x40000000鐃緒申鐃緒申鐃淑わ申鐃� -1073741824 鐃夙わ申鐃緒申鐃緒申鐃夙になわ申泙鐃緒申鐃�

鐃緒申鐃緒申鐃粛子は￥申鐃淑駕申鐃叔再醐申鐃緒申鐃暑こ鐃夙わ申鐃緒申鐃緒申泙鐃緒申鐃�

#include <stdio.h>
int main (int argc, char **argv){
    signed int mid;
    signed int high = 0x40000000;
    signed int low  = 0x40000000;
    mid = (high + low) / 2;
    printf("%d\n", mid);
}

32bit platform鐃淑わ申峇鐃緒申鐃緒申未鐃竣￥申-1073741824鐃夙わ申鐃緒申鐃緒申鐃緒申鐃緒申鐃出わ申呂鐃緒申任鐃緒申鐃�

鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃�1GB鐃緒申鐃塾わ申鐃祝わ申鐃緒申鐃緒申鐃緒申鐃緒申腓�鐃緒申鐃緒申鐃緒申鐃緒申鐃�bsearch鐃緒申鐃緒申鐃緒申sort鐃緒申鐃緒申鐃緒申箸鐃緒申鐃緒申鐃緒申鐃緒申呂鐃緒申泙鐃淑わ申鐃緒申鐃緒申鐃叔わ申鐃緒申鐃緒申鐃緒申鐃重�鐃夙駈申鐃緒申鐃叔わ申suffix array鐃夙わ申鐃緒申鐃緒申鐃塾ワ申鐃緒申鐃緒申鐃祝ぶわ申鐃緒申鐃緒申鐃所そ鐃緒申鐃叔わ申鐃緒申

鐃緒申鐃淑みに￥申鐃緒申鐃薯コ￥申鐃宿は以駕申鐃塾よう鐃淑器申鐃緒申鐃祝なわ申泙鐃緒申鐃緒申鐃�

int mid(int low, int high){ /* macro 鐃叔もい鐃緒申? */
    return low + ((high - low) / 2);
}

鐃熟￥申鐃宿ワ申鐃緒申鐃緒申鐃塾進駕申鐃緒申鐃緒申鐃春トワ申鐃緒申鐃緒申鐃塾バワ申鐃緒申覆鐃緒申鐃緒申鐃緒申鐃銃わ申鐃殉っわ申鐃夙わ申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃緒申鐃塾わ申泙鐃緒申鐃粛￥申

Dan the Man with Too Many Bits to Crunch

鐃宿居申:鐃緒申鐃緒申鐃処く鐃緒申鐃緒申鐃緒申鐃順元鐃緒申Joshua Bloch鐃塾とわ申鐃緒申鐃祝わ申椶辰討鐃�fix鐃緒申鐃淑￥申鐃緒申鐃曙。鐃藷じわ申鐃緒申反則鐃緒申鐃叔￥申

int mid(int low, int high){
    return (int)(((double)high + (double)low)/2);
}