代码

int binary_search(const unsigned *line, int ub, unsigned value){
int down = 0;register int up=ub;
    while(1){
        register int estimate = down + 
        (up - down) *
        (value -line[down]) / 
        (line[up] - line[down]);
        estimate += ( estimate == down );
        estimate -= ( estimate == up );
        if(line[estimate] == value)return estimate;
        (line[estimate] < value?down:up) = estimate;
    }
    return 0;
}

评测结果