#include<stdio.h>
int BinSearch(int a[ ],int low, int high, int key)
{
if (low<=high)
{
int mid = (low+high)/2;//一分为二
if(key==a[mid])
return mid;//找到key,返回所在位置(递归结束)
else if(key<a[mid])
high=mid-1;//递归求解
else if(key>a[mid])
low=mid+1;//递归求解