/**
11.3 有序表查找
(1)折半查找方法
*/
int binSearch(int a[],int n,int key)
{
int low=0;
int high = n-1;
int mid ;
while(low<=high)
{
mid= (low+high)/2;
if(a[mid]==key) return mid;
else if(a[mid]>key) high = mid-1;
else low=mid+1;
}
return -1;//没找到!
}
int main()
{
int a[]={1,3,5,7,9};
int res = binSearch(a,5,7);
cout<<res<<endl;//3
return 0;
}