使用二分查找方法的前提:已知数组为有序的(此处的样例数组由小到大排列)
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main()
{
int a[] = { 1,2,3,4,5,6,7,8,9,10 };
int target = 2;//找寻的目标
int left = 0, right = sizeof(a) / sizeof(a[0]) - 1, mid = 0;// sizeof(a) / sizeof(a[0])求数组元素个数
while (left <= right)
{
mid = (left + right) / 2;
if (target < a[mid])
{
right = mid - 1;
}
else if (target > a[mid])
{
left = mid + 1;
}
else
{
printf("在数组中%d的下标为%d", target, mid);
break;
}
}
if(left>right)//查找截止条件
printf("找不到");
return 0;
}