算法8.2 int search bin( SSTable ST, Key Type key)/折半查找 f int low, high, mid low=l; high-STlength while (low high) f mid=(low+high)/2 if(eQ(key, ST elem [ mid]. key)) return mid else if (lt(key, STelem mid. key)) high=mid-1 else low-mid+1 eturn o算法8.2 int Search_Bin(SSTable ST,KeyType key) //折半查找 { int low,high,mid; low = 1; high=ST.length; while (low < high) { mid = (low+high)/2; if (EQ(key,ST.elem[mid].key)) return mid; else if (LT(key,ST.elem[mid].key)) high=mid-1; else low=mid+1; } return 0; }