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
(d) interpolation search
A simple yet interesting question from data structure and algorithms.