在一个有序数组中查找具体的某个数字
include<stdio.h>
include<stdlib.h>
int main()
{
int arr[]={1,2,3,4,5,6,7,8,9,10};
//下标 0 1 2 3 4 5 6 7 8 9
int k = 7;
//进行二分查找
int left = 0;
int right = sizeof(arr)/sizeof(arr[0]) -1 ;
while(left<=right)
{
int mid = (right - left)/2+left;
if(arr[mid]<k)
{
left = mid +1;
}
else if(arr[mid]>k)
{
right = mid -1;
}
else
{
printf("找到啦！下标是%d",mid);
break;
}
}
if(left>right)
{
printf("找不到！");
}
system("pause");
return 0;
}
