[with sth; see also: relative
The algorithm compares x with each entry in turn until a match is found or the list is exhausted.
Our asymptotic results compare reasonably well with the numerical results reported in .
We divide them into three classes depending on the width of the middle term as compared with the width of the other terms.
We show that A is negligible compared with B.