</pre><pre name="code" class="cpp">#include<stdio.h>
int bin_search(int num[],int low,int high,int key)
{
int mid ;
while(high>=low)
{
mid = (high+low)/2;
if(num[mid] == key)
{
return mid;
}
else if(num[mid] < key)
{
low = mid + 1;
}
else if(num[mid] > key)
{
high = mid - 1;
}
}
return -1;
}
int main()
{
int num[5] ={1,2,3,4,5};
int a = 0;
a = bin_search(num,0,4,9);
printf("%d",a);
return 0;
}
折半查找法(迭代)
最新推荐文章于 2021-01-10 15:47:05 发布