A linear probing sort and its analysis(Preliminary Draft)

Authors:
Gaston H. Gonnet;J. Ian Munro
Affiliations:
-;-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 3
Cited 3

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Internal Sorting by Radix Plus Sifting

Journal of the ACM (JACM)
Generating Sorted Lists of Random Numbers

ACM Transactions on Mathematical Software (TOMS)

Analysis of bounded disorder file organization

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Analysis of Uniform Hashing

Journal of the ACM (JACM)
A constructive approach to the design of algorithms and their data structures

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a variant of the distribution sort approach which makes use of extra storage to sort a list of n elements in an average of about (2+@@@@2)n &equil; 3.412...n probes into a table. An accurate analysis of this technique is made by introducing a transform from a Poisson approximation to the exact (finite) distribution. This analysis also leads to the solution of an interesting parking problem.