思路:
寻找key:每次先查找中间的值,若相等返回对应下标;
若key大于中间值,在数组右边继续寻找;若key小于,寻找左边;
int f(int m,int n,int a[],int x)
{
if(m<=n)
{
int mid=(n+m)/2;
if(a[mid]==x) return mid+1;
else if(a[mid]<x) return f(mid+1,n,a,x);
else return f(m,mid-1,a,x);
}
else return -1;
}