Multiple choice general knowledge science & technology Which of the following is not the required condition for binary search algorithm? The list must be sorted there should be the direct access to the middle element in any sublist There must be mechanism to delete and/or insert elements in list 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 Option D is the correct answer because binary search efficiency (O(log n)) works well regardless of data size - the 1000-element limit mentioned is not a requirement. Options A, B, and C are all actual requirements for binary search.