编辑代码

#include <stdio.h>
int BinSearch(int arr[],int len,int key) //折半查找法(二分法)

{

int low=0; //定义初始最小

int high=len-1; //定义初始最大

int mid; //定义中间值

while(low<=high)

{

mid=(low+high)/2; //找中间值

if(key==arr[mid]) //判断min与key是否相等

return mid;

else if(key>arr[mid]) //如果key>mid 则新区间为[mid+1,high]

low=mid+1;

else //如果key

high=mid-1;

}

return -1; //如果数组中无目标值key，则返回 -1 ；

}

int main()

{

int arr[]={3,44,38,5,47,15,36,26,27,2,46,4,19,50,48}; //对数组arr进行排序

printf("%d \n",BinSearch(arr,(sizeof(arr)/sizeof(arr[0])),26));

return 0;

}