//二分查找
int Find(SeqList &L, int low, int high, int key)
{
int mid;
while(low <= high)
{
mid =(low+high)/ 2;
if(L.data[mid] > key)
high = mid-1;
else if(L.data[mid] < key)
low = mid+1;
else
return mid;//查找成功则返回所在位置
}
return -1;
}
E-有序顺序表查询-二分查找
最新推荐文章于 2022-09-29 20:53:42 发布