#include<iostream>
using namespace std;
int BinarySearch(int a[],int key, int n)
{
int low,high;
low =0,high = n-1;
int middle;
while(low <= high)
{
middle = (low+high) /2;
if(a[middle] == key)
return middle;
if(a[middle] > key)
{
high = middle-1; //
}
else
{
low = middle+1;;
}
}
return -1;
}
int main()
{
int p[5] = {2,5,6,8,4};
cout << BinarySearch(p,10,5 );
return 0;
}
c++之二分查找
最新推荐文章于 2024-05-30 20:15:33 发布