>
>
> >
> > *if (rp[low] == col) high = low+1;else *       if (rp[t] > col) high = t;
> >         else low = t;
>
> Replacing a single comparison per bsearch iteration with two doesn't
> seem like a good choice to me.
>
>
It forces the bisection search and the linear search to terminate in one
iteration.

Reply via email to