摘要：
二分查找int search_bin(SSTable ST, KeyType key){ low = l; 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;}快速排序void qsort(S... 阅读全文
