$***$ Question Completion Status:

QUESTION $27$

The complexity of bisection search of sorted data is:

$O(\frac{n}{2})$

$O(n)$

$O(logn)$

$O(nlogn)$