折半查找
#include<iostream>
using namespace std;
int input(int a[],int n)
{ int i;
for(i=0;i<n;i++)
cin>>a[i];
}
int binsearch(int a[],int n,int x)
{int mid;
mid=n/2;
while(a[0]<n&&a[mid]!=x)
{ if(a[mid]<x) a[0]=mid+1;
if(a[mid]>x) n=mid-1;
mid=(a[0]+n)/2;
}
if(a[mid]!=x)
return 0;
else
return mid+1;
}
int main()
{
int a[20],n=0,value;
int position;
cin>>n;
input(a,n);
cin>>value;
position =binsearch(a,n,value);
cout<<position;
return 0;
}