Question

gos u sulObls Map & Locations Contact U s Organizations Help The algorithm has time complexity O(5). QUESTION 3 Consider plist (1,2,3, 4,5, 6,7, 8, 9, 10). We call recursive BinarySearch) to search the list for pkey- 4. During the search, the first time that pKey is greater than the element at middle we vwill make a recursive call passing middle +1 and pHigh as the indices for the range of plist to be searched in the recursive call. What will be the values of middle+ 1 and pHigh? middle + 1 will be 5 and pHigh will be 3 middle + 1 will be 3 and pHigh will be 3 middle + 1 will be 4 and pHigh will be 9 middle + 1 will be 2 and pHigh will be 3 Save All A click cove ondd cuubmit to sowe andd submit click Save All Answers to save all answers

Answer 1

ANSWER

middle + 1 will be 2 and pHigh will be 3

EXPLANATION

a[mid] = 5 | mid = 4 | low = 0 | high = 9
a[mid] = 2 | mid = 1 | low = 0 | high = 3 <- this is the case we are looking for
a[mid] = 3 | mid = 2 | low = 2 | high = 3
a[mid] = 4 | mid = 3 | low = 3 | high = 3
Element is present at index 3

mid + 1 = 1 + 1 = 2

pHigh = 3