折半查找递归

int BinarySearch(int* _array,int left, int right, int e)
{
    int middle = (left+right)/2;

    if(left > right)
    {
        return -1 ;
    }
    if(_array[middle] < e)
    {
        return BinarySearch(_array,middle,right,e);
    }else if(_array[middle] == e)
    {
        return middle;
    }
    else
    {
        return BinarySearch(_array,left,middle,e);
    }
    return -1;
}