每一次查找都从中间开始查找,一次排除一半的结果。
#include <stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 }; //要查找的数组
int left = 0; //左边的下标
int n = 0;//我们要查找的数
printf("请输入你要查找的数:");
scanf("%d", &n);
int sz = sizeof(arr) / sizeof(arr[0]);
int right = sz - 1; //右边的下标
while (left <= right)
{
int mid = (left + right) / 2;
if (arr[mid] < n)
{
left = mid+1;
}
else if (arr[mid] > n)
{
right = mid-1;
}
else
{
printf("找到了,下标为:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到\n");
}
return 0;
}