一、静态查找表
1.顺序查找
int s_search(S_TBL tbl, KEY kx)
{
tbl.elem[0].key = kx;
for(i = tbl.length; tbl.elem[i].key != kx; i --) ;
return i;
}
2.有序表的折半查找
int binary_search(S_TBL tbl, KEY kx)
{
int mid;
int flag;
int low = 1;
int high = tbl.length;
while(low <=high) {
mid = (low + high) / 2;
if(kx < tbl.elem[mid].key) {
high = mid - 1;
} else if (kx > tbl.elem[mid].key) {
low = mid + 1;
} else {
flag = mid;
break;
}
}
return flag;
}
未完。。