Queues Q. 28
0. A________search begins the search with the element that is located in the middle of the array.
- Option : D
- Explanation : Binary Search algorithm can do this because it firstly searches the middle element. If the required element is less than the middle one, then search the middle element in the less than a part. If the required element is greater than the middle one, then search in the greater part. So the answer is 'D'.
