论文信息 - In-place Linear Probing Sort

In-place Linear Probing Sort

We introduce the first sorting algorithm that is proven to sort n randomly drawn uniformly distributed elements in θ(n) time in situ. The constants in this algorithm are small, and simulations have shown it competitive with other sorting algorithms. It is, furthermore, conceptually simple and easy to code, which makes it a practical distributive sorting algorithm.

Jukka Teuhola | Svante Carlsson | Jyrki Katajainen

[1] Gaston H. Gonnet,et al. Handbook Of Algorithms And Data Structures , 1984 .

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[4] W. W. Peterson,et al. Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[5] Teofilo F. Gonzalez,et al. Sorting Numbers in Linear Expected Time and Optimal Extra Space , 1982, Inf. Process. Lett..

[6] C. C. Handley. An in Situ Distributive Sort , 1986, Inf. Process. Lett..

[7] Donald E. Knuth,et al. Ordered Hash Tables , 1974, Comput. J..

[8] M. Donald MacLaren. Internal Sorting by Radix Plus Sifting , 1966, JACM.

[9] Derick Wood,et al. Implicit Selection , 1988, SWAT.

[10] Ronald L. Rivest,et al. Expected time bounds for selection , 1975, Commun. ACM.

[11] J. IAN MUNRO,et al. The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform , 1984, J. Algorithms.