01-复杂度3 二分查找

Position BinarySearch( List L, ElementType X ){
    int high = L->Last;
    int low = 1;
    while(low<=high){
        int mid = (low+high)/2;
        if(L->Data[mid]==X){
            return mid;
        }else if(L->Data[mid]>X){
            high = mid-1;
        }else{
            low = mid+1;
        }
    }
    return NotFound;
}