The binary search algorithm is an example of an algorithm in which of the following classes?
A) $\Theta \left( \log _ { 2 } n \right)$
B) $\Theta ( n )$
C) $\Theta \left( n \log _ { 2 } n \right)$
D) $\Theta \left( n ^ { 2 } \right)$

Question

Quizplus · Accepted Answer

Binary search has a time complexity of $\Theta(\log_2 n)$ because it divides the search interval in half each time.

The Binary Search Algorithm Is an Example of an Algorithm Θ(log⁡2n)\Theta \left( \log _ { 2 } n \right)Θ(log2​n)

The Binary Search Algorithm Is an Example of an Algorithm $\Theta \left( \log _ { 2 } n \right)$