Multiple choice technology architecture

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

  1. must use a sorted array

  2. 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. 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 has O(log n) time complexity, which remains efficient even for large datasets. The efficiency depends on the logarithmic growth rate, not on a fixed number like 1000. Options A, B, and C are actual limitations: binary search requires sorted data and direct access to the middle element, which can be expensive to maintain with frequent insertions/deletions.

Keep practicing — related questions