静态查找表 折半查找的算法 int Search Bin(SSTable St, Key Type key) i low=l; high-STlength; while(low<high i mid=(low+high)/2 if (eQ(key, STelem(mid].key)) return mid Ise if(t(key, STelem[mid]. key)) high=mid-1 else low=mid+1静态查找表 ◼ 折半查找的算法 int Search_Bin(SSTable ST, KeyType key) { 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; } }