线性表的存储结构
#define MAXL 10
typedef int KeyType;
typedef int InfoType;
struct RecType {
KeyType key;
InfoType data;
};
typedef RecType SeqList[MAXL];
折半查找算法
int BinSearch(SeqList R,int n,KeyType k) {
int low=0,high=n-1,mid;
while(low<=high) {
mid=(low+high)/2;
if(R[mid].key==k)
return mid;
if(R[mid].key>k)
high=mid-1;
else
low=mid+1;
}
return -1;
}
暂无评论