The time complexity of binary search is O(log n), where n is the number of elements in the array.

Binary search is a more efficient search algorithm that works by dividing the search space in half at each step. It requires that the input array be sorted and checks the middle element of the current search space.

If the middle element is equal to the target value, the search is successful.
Else if the middle element is less than the target value, the search continues in the right half of the array.
Else the middle element is greater than the target value and the search continues in the left half of the array.