函数分析如下:
Binary_search(SqList L,ElemType key) 参数:顺序表L,待查关键字 功能:查找key 时间复杂度:O(logn)
每次和中间值比较,相同返回下标,不相同调整边界。
函数代码:
//二分查找函数
int Binary_search(SqList L,ElemType key)
{
int low = 0;int mid = 0;int high = L.length-1;
while(low<=high)
{
mid = (low+high)/2;
if(key==L.data[mid])
{
return mid;
}
else if(key>L.data[mid])
{
low = mid+1;
}
else
{
high = mid-1;
}
}
return -1;
}
---------------------
原文:https://blog.csdn.net/lady_killer9/article/details/83420065