【考研-数据结构】查找算法
typedef struct{
int *elem;
int length;
}SSTable;
int Search_Seq(SSTable S,int k){
for(int i = 0;i<S.length;i++){
if(S.elem[i] == k){
return i;
}
}
return -1;
}
int Search_Seq_02(SSTable S,int k){
S.elem[0] = k;
for(int i = S.length;S.elem[i]!=k;i--)
return 0;
}
int Binary_Search(SSTable S,int k){
int low = 0,high = S.length-1,mid;
while(low<=high){
mid = (low+high)/2;
if(S.elem[mid] == k) return mid;
else if(S.elem[mid]<k) low = mid+1;
else high = mid-1;
}
return -1;
}
typedef struct{
int maxValue;
int low,high;
}Index;
int List[100];
typedef struct Node{
int keys[4];
struct Node*child[5];
int num;
};