interpolation-sequential search

(algorithm)

Definition: An approximate location is interpolated from the first and last items of a sorted array, then a linear search finds the actual location.

See also interpolation search.

Author: PEB

Implementation

(Pascal) or (Pascal)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "interpolation-sequential search", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/interpsequen.html