6-13 折半查找 (15 分)

代码：

int BinArray(SSTable T, int start, int end, KeyType k)
{
 int mid = (start + end) / 2;
 while (start <= end) {
  if (T.R[mid].key == k) return mid;
  else if (T.R[mid].key > k) return BinArray(T, start, mid - 1, k);
  else return BinArray(T, mid + 1, end, k); 
 }
 return -1;
}
int  Search_Bin(SSTable T, KeyType k)
{
 int result = BinArray(T, 0, T.length - 1, k);
 if (result == -1) return 0;
 else return result;
}