Question

Which of the following is true about the binary search algorithm when applied to a sorted array?

• A. It always has a time complexity of O(n)
• B. It works on unsorted arrays
• C. It divides the search space into two equal halves on each iteration
• D. It requires that the array be sorted in descending order

Hint:

Binary search only works on sorted arrays. It divides the search space in half each time, making it an efficient O(log n) algorithm. Always ensure that the array is sorted before applying binary search.

Answer 1

The Correct Option is C

Understanding Binary Search 
- Binary search works by dividing the search space in half at each step. 
- It requires the array to be sorted in ascending order for proper functioning. 

Thus, the correct statement is: "It divides the search space into two equal halves on each iteration.