NIST

linear probing sort

(algorithm)

Definition: Distribute each of n elements to one of m locations in an array (m>n) based on an interpolation of the element's key. In case of collisions, put the element in the next empty location. The array has extra space at the end for overflow. The second pass packs the elements back into an array of size n.

Generalization (I am a kind of ...)
distribution sort.

Aggregate child (... is a part of or used in me.)
linear probing.

Note: The sort may fail if the overflow is exceeded.

The distribution phase may be seen as putting the elements in a linear probing hash table using the interpolation function as the hash function.

Author: PEB

Implementation

(C and 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 7 January 2013.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "linear probing sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 7 January 2013. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/linearProbingSort.html