论文信息 - In-Place Sorting with Fewer Moves

In-Place Sorting with Fewer Moves

It is shown that an array of n elements can be sorted using O(1) extra space, O(nlogn/loglogn) element moves, and nlog2n+O(nloglogn) comparisons. This is the first in-place sorting algorithm requiring o(nlogn) moves in the worst case while guaranteeing O(nlogn) comparisons, but due to the constant factors involved the algorithm is predominantly of theoretical interest.

Jyrki Katajainen | Tomi Pasanen

[1] Arne Andersson. Sorting and Searching Revisted , 1996, SWAT.

[2] Jon Louis Bentley,et al. Engineering a sort function , 1993, Softw. Pract. Exp..

[3] Toshihide Ibaraki,et al. Proceedings of the Third International Symposium on Algorithms and Computation , 1992 .

[4] Venkatesh Raman,et al. Sorting with Minimum Data Movement , 1992, J. Algorithms.

[5] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[6] Venkatesh Raman,et al. Selection from Read-Only Memory and Sorting with Minimum Data Movement , 1996, Theor. Comput. Sci..

[7] David Thomas,et al. The Art in Computer Programming , 2001 .

[8] K. Reinhardt. Sorting In-Place with a Worst Case Complexity of n log n − 1 . 3 n + O ( log n ) Comparisons and ε n log n + O ( 1 ) Transports ∗ , 1992 .

[9] Jukka Teuhola,et al. Practical In-Place Mergesort , 1996, Nord. J. Comput..

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