注:源码来自与严蔚敏的算法与数据结构,在这边做个笔记
int search_Bin(SSTable ST, KeyType key)
{
low=1,high=ST.length;
while(low<=high)
{
mid=(low+high)/2;//折半
if(key==ST.R[mid].key)//找到了
return mid;
else if (key<ST.R[mid].key)在mid的左边
return high=mid-1;
else
return low=mid+1;//在mid的右边
}
reutrn 0;
}