#include <stdio.h>
int binarysearch(int a[],int n,int k);
int main(){
int a[]={13,27,38,49,50,65,76,97};
int location=binarysearch(a,8,97);
printf("输出结果为%d",location);
}
//折半查找元素某元素
int binarysearch(int a[],int n,int k){
int low=0,high=n-1,mid;
while(low<=high){
mid=(high+low)/2;
if(a[mid]==k){
return mid;//返回mid
}
if(k>a[mid]){
low=mid+1;//准备查找后半部分
}else{
high=mid-1;//准备查找前半部分
}
}
return high;//返回high
}