#include<iostream>
#include<cstdio>
using namespace std;
int BinartSearch(int a[],int n,int k)
{
int low=1;
int high=n;
int mid;
while(low<=high)
{
mid=(low+high)/2;
if(a[mid]==k) return mid;
else if(a[mid]>k) high=mid-1;
else low=mid+1;
}
return 0;
}
int main()
{
int a[11];
for(int i=1;i<=10;i++)
a[i]=i;
printf("%d\n",BinartSearch(a,10,6));
return 0;
}
03-27