Which of the following searching algorithm is fastest when the input array is not sorted but has uniformly distributed values?
(a) jump search
(b) linear search
(c) binary search
(d) interpolation search
This question was posed to me by my college director while I was bunking the class.
This intriguing question originated from Searching in chapter Searching of Data Structures & Algorithms II