A Monte Carlo comparison of the binary and interpolation search algorithms

Authors:
Clark B. Archer
Affiliations:
Winthrop College, School of Business, Rock Hill, South Carolina
Venue:
SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
Year:
1987

Citing 2
Cited 0

Data structures using Pascal

Data structures using Pascal
Interpolation search—a log logN search

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.