Which algorithm repeatedly divides the search interval into two halves?

Options

  • A. Linear Search
  • B. Binary Search
  • C. Bubble Sort
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. Binary Search

Detailed Explanation

Binary Search repeatedly divides a sorted search interval into two approximately equal parts. After comparing the target with the middle element, one half can be eliminated from further consideration. This gives binary search a worst-case time complexity of O(log N). The key requirement for the standard array-based version is that the data must be sorted, and efficient random access is useful for accessing the middle element.