Quiz Question 1 of 5
In a binary search algorithm, if the middle element is not equal to the key and the key is greater than the middle element, which of the following best describes the next step in the search process?
Choose the correct answer below:
-
A
The search continues in the right subarray of the middle element, and the middle element is also included.
-
B
The algorithm terminates as the key is not present.
-
C
The search continues in the right subarray, excluding the middle element.
-
D
The search continues in the left subarray of the middle element.