#include
int search(int k,int number[],int length)
{
int ret=-1;
int left=0;
int right=length-1;
int mid=(left+right)/2;
if (number[mid]>k)
right=mid-1;
else if(number[mid]
left=mid+1;
else(number[mid]=k);
return mid;
return ret;
}
int main(){
int number[]={1,2,3,4,5,6,7,8,9,10};
int k=11;
int length=sizeof(number)/sizeof(number[0]);
int a=search(k,number,length);
if(a==-1)
{
printf("找不到指定的数字\n");
}
else
{
printf("找到该数下标为：%d\n",a);
}
return 0;
}