In-place sorting with fewer moves

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 31-37

  Katajainen, Jyrki ^a   Pasanen, Tomi A ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MERGING;

IN-PLACE ALGORITHMS; MULTIWAY MERGING;

SORTING;

EID: 0033574359     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00038-1     Document Type: Article

References (10)

1. J.L. Bentley, M.D. McIlroy, Engineering a sort function, Software - Practice and Experience 23 (1993) 1249-1265.
2. T. Hagerup, Sorting and searching on the word RAM, in: Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 366-398.
3. V. Geffert, J. Katajainen, T. Pasanen, Asymptotically efficient in-place merging, Theoret. Comput. Sci. 225 (1999).
4. J. Katajainen, T. Pasanen, J. Teuhola, Practical in-place merge-sort, Nordic J. Comput. 3 (1996) 27-40.
5. D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 2nd edn., Addison-Wesley, Reading, MA, 1998.
6. T.W. Lai, D. Wood, Implicit selection, in: Proc. 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer, Berlin, 1988, pp. 14-23.
7. J.I. Munro, V Raman, Sorting with minimum data movement, J. Algorithms 13 (1992) 374-393.
8. J.I. Munro, V. Raman, Selection from read-only memory and sorting with minimum data movement, Theoret. Comput. Sci. 165 (1996) 311-323.
9. J. Pagter, T. Rauhe, Optimal time-space trade-offs for sorting, in: Proc. 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 264-268.
10. K. Reinhardt, Sorting in-place with a worst case complexity of n log n -1.3n + O(log n) comparisons and εn log n + O(1) transports, in: Proc. 3rd International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 650, Springer, Berlin, 1992, pp. 489-498.