What does Binary search refer to?
- A. A search algorithm that repeatedly divides a sorted array in half to locate a target value. ✓
- B. A graph traversal algorithm that explores as far as possible along each branch before backtracking.
- C. A mathematical notation used to describe the upper bound of an algorithm's time or space complexity.
- D. An algorithm that finds the shortest path between nodes in a graph with non-negative edge weights.
Correct answer
A. A search algorithm that repeatedly divides a sorted array in half to locate a target value.
Explanation
Binary search refers to a search algorithm that repeatedly divides a sorted array in half to locate a target value.