| Sequential Search Efficiency | Divide and Conquer Search Efficiency |
|---|---|
| Ο(n) | Ο(log(n)) |
To say that a procedure's time is Ο(g(n)), for example, Ο(log(n)) is to say that, for all but perhaps finitely many exceptions, it is known to lie below a constant multiple of log(n).
To say that a procedure's time is Θ(log(n)) is to add that it is known to lie above a constant multiple of log(n) as well.