A Monte Carlo comparison of the binary and interpolation search algorithms

Abstract

This paper provides performance comparisons of the traditional binary search and the interpolation search for nearly uniformly distributed ordered arrays of keys. The algorithms for the search routines are given along with performance statistics.

DOI: 10.1145/31820.31815

Extracted Key Phrases

Cite this paper

@inproceedings{Archer1987AMC, title={A Monte Carlo comparison of the binary and interpolation search algorithms}, author={Clark B. Archer}, booktitle={SIGCSE}, year={1987} }