Question #152174
Which of the following is a required condition for binary search algorithms?
A. the list must be sorted.
B. there should be the direct access to the middle element in any sub list.
C. The number of elements in the list should be finite
D. An item round can always be obtained as a middle element.
A. the list must be sorted.
B. there should be the direct access to the middle element in any sub list.
C. The number of elements in the list should be finite
D. An item round can always be obtained as a middle element.
Expert's answer
Answer A:
the list must be sorted
Learn more about our help with Assignments: C++
