Multiple choice

Which of the following is not a limitation of binary search algorithm?

  1. It must use a sorted array.

  2. The requirement of sorted array is expensive when a lot of insertion and deletions are needed.

  3. There must be a mechanism to access middle element directly.

  4. The binary search algorithm is not efficient when the data elements are more than 1000.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Binary search IS efficient (O(log n)) even for large datasets - its power grows with size. The real limitations are: A) it requires a sorted array, B) maintaining sorted order is costly with frequent insertions/deletions (requires resorting or complex data structures), and C) it needs direct middle element access (random access, not suitable for linked lists). Option D is NOT a limitation.

Keep practicing — related questions