int Bsearch(int R[],int low,int high,int val)
{
    int mid;
    while(low<=high)
    {
        mid=(low+high)/2;  //取當前表的中間位置 
        if(R[mid]==val)
            return mid;
        else if(R[mid]>val)//說明要在R[low，…，mid-1]中尋找 
            high=mid-1;
        else low=mid+1;    //說明要在R[mid+1，…，high]中尋找 
 

    }
    return -1;
}

相關推薦