简单二分查找法(只适用于数组元素数字顺序排列)
#include<stdio.h>
int main()
{
int arr[10] = { 1,2,3,4,5,6,7,8,9,10};
int right = 0, left = 0, mid = 0,k=0;
right = sizeof(arr)/sizeof(arr[0])-1;//计算数组元素个数-1为数组最大下标
printf("k:");
scanf("%d", &k);
while (left<=right)//二分查找
{
mid = (right + left) / 2;//取中间值
if (arr[mid] > k)//若大于则往左缩小查找范围
{
right = mid - 1;
}
else if (arr[mid] < k)//若小于则往右缩小查找范围
{
left = mid + 1;
}
else
{
printf("已经找到该数组元素数组下标为:%d\n", mid);
break;
}
}
if (left >= right)//注意如果所要查找值不在数组内left,right会互换
printf("找不到了");
return 0;
}