#include "stdio.h"
int main()
{
int arr[]={1,2,3,4,5,6,7,8,9,10};
int k=8;
int sz=sizeof(arr)/sizeof(arr[0]);
int left=0;
int right=sz-1;
while(left<=right)
{
int mid=(left+right)/2;
if(arr[mid]>k)
{right=mid-1;
}
else if (arr[mid]<k)
{
left=mid+1;
}
else
{
printf("yes:%d\n",mid);
break;
}
if(right<left)
{printf("no");}}}
经典的二分法查找,将数组分成2边,减轻程序的负担