Which of the following is not an application of binary search?
2025
Which of the following is not an application of binary search?
- A.
To find the lower/upper bound in an ordered sequence
- B.
Union of intervals
- C.
Debugging
- D.
To search in unordered list
Attempted by 100 students.
Show answer & explanation
Correct answer: D
Answer: D
Explanation: Binary search relies on the list being sorted to repeatedly divide the search space. It is used for tasks like finding bounds in sorted arrays, debugging, or searching in ordered data. However, it cannot be applied directly to unordered lists because the algorithm depends on the ordering to eliminate half the search space at each step. Therefore, searching in an unordered list is not a valid application of binary search.