When is the uniform binary search an optimization over the usual binar – McqOptions

MCQOPTIONS

1.	When is the uniform binary search an optimization over the usual binary search?
A.	A table lookup is generally faster than an addition and a shift
B.	Many searches will be performed on the same array
C.	Many searches will be performed on several arrays of the same length
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Which of the following false about Jump Search?
How can Jump Search be improved?
Given, arr = {1,3,5,6,7,9,14,15,17,19} key = 17 and delta = {5,3,1,0}How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
What is the time complexity of uniform binary search?
In which of the cases uniform binary search fails compared to binary search?
Given delta[4] is a global array and number of elements in the sorted array is 10, what are the values in the delta array?
When is the uniform binary search an optimization over the usual binary search?