#include<stdio.h>
#define m 5
int f(int a[100],int n);
int main()
{
int a[100],n,i,j;
for(i=0;i<m;i++)
scanf("%d",&a[i]);
scanf("%d",&n);
j=f(a,n);
if(j>=0)
printf("n=%d,index=%d",n,j);
else
printf("not be found");
return 0;
}
int f(int a[100],int n)
{
int low=0,mid,high=m-1;
while(low<=high)
{
mid=(high+low)/2;
if(n>a[mid])
low=mid+1; //若对从大到小的数进行查找,只需使此行与下下行调换位置即可
else if(n<a[mid])
high=mid-1;
else
return mid;
}
return -1;
}