Answers are grounded in this paper and cite their sources.
Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the statistical distribution of the keys. It is shown that on the average log log N file accesses are required to retrieve a key, assuming that the N keys are uniformly distributed. The number of extra accesses is also estimated and shown to be very low. The same holds if the cumulative distribution function of the keys is known. Computational experiments confirm these results.
No takes yet. Share an insight, caveat, or question.
Perl et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: