Q76
Which of the following searching algorithm is fastest when the input array is sorted but has non uniformly distributed values?
A.
jump search
B.
linear search
C.
binary search
AnswerD.
interpolation search
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board