#include <stdio.h>
int main()
{
int arr[]={1,2,3,4,5,6,7,8,9,10};//有序数组查找某个数字
int k=4;//假设本次查找数字4的下标
int sz = sizeof(arr)/sizeof(arr[0]);
int right = sz-1;
int left = 0;
while (left <= right)
{
int mid = (right+left)/2;//这个应该要放在这里,二分法,每次去除一半
if(arr[mid] > k)
{
right = mid-1 ;
}
else if(arr[mid] <k)
{
left = mid+1;
}
else
{
printf("%d",mid);
break;
}
}
if(left > right)
{
printf("找不到该数字");
}
return 0;
}
用本次代码可以找到k=4时的下标,采用了二分查找的方法,比顺序查找更为简便