Which of the following searching algorithm is fastest when the input array is sorted and has uniformly distributed values?
(a) jump search
(b) exponential search
(c) binary search
(d) interpolation search
This question was addressed to me in an interview.
Question is taken from Searching topic in division Searching of Data Structures & Algorithms II