An in-place sorting with O(n log n) comparisons and O(n) moves

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 242-250

  Franceschini, G ^a   Geffert, V ^b  

^a UNIVERSITY OF PISA   (Italy)

^b P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Computer science; Contracts; History; Internet; Layout; Merging; Sorting; Upper bound

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; CONTRACTS; HISTORY; INTERNET; MERGING; SORTING;

COMPUTATIONAL RESOURCES; ELEMENT COMPARISON; IN-PLACE ALGORITHMS; LAYOUT; LOWER BOUNDS; SORTING ALGORITHM; UPPER BOUND;

ALGORITHMS;

EID: 1842602935     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238198     Document Type: Conference Paper

References (15)

1. R. Floyd. Treesort 3 (Algorithm 245). Comm. Assoc. Comput. Mach., 7:701, 1964.
2. G. Franceschini. An in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves. Technical report, Dipartimento di Informatica, Università di Pisa, March 2003. (Available from ftp://ftp.di.unipi.it/pub/techreports/TR-03-06.ps.Z).
3. V. Geffert. Sorting with O(n log n) comparisons and O(n) transports, in-place, in the worst case, simultaneously. Technical report, P. J. Šafárik University, July 2002. (Available from http://cs.science.upjs.sk/publikacie/geffert/ultim.ps).
4. V. Geffert, J. Katajainen, and T. Pasanen. Asymptotically efficient in-place merging. Theoret. Comput. Sci., 237:159-81, 2000.
5. A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. Internat. Colloq. Automata, Languages, & Programming, volume 115 of Lect. Notes Comput. Sci., pages 417-31. Springer-Verlag, 1981.
6. J. Katajainen and T. Pasanen. In-place sorting with fewer moves. Inform. Process. Lett., 70:31-37, 1999.
7. J. Katajainen, T. Pasanen, and J. Teuhola. Practical in-place Mergesort. Nordic J. Comput., 3:27-40, 1996.
8. D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, 1973. (Second edition: 1998).
9. J. Munro and V. Raman. Sorting with minimum data movement. J. Algorithms, 13:374-93, 1992.
10. J. Munro and V. Raman. Fast stable in-place sorting with O(n) data moves. Algorithmica, 16:151-60, 1996.
11. J. Munro and V. Raman. Selection from read-only memory and sorting with minimum data movement. Theoret. Comput. Sci., 165:311-23, 1996.
12. V. Raman. Sorting In-Place with Minimum Data Movement. Ph.D. thesis, Univ. Waterloo, Dept. Comput. Sci., 1991. (Tech. Rep. 91-12).
13. 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. Internat. Symp. Algorithms and Comput., volume 650 of Lect. Notes Comput. Sci., pages 489-98. Springer-Verlag, 1992.
14. D. Willard. Maintaining dense sequential files in a dynamic environment. In Proc. Symp. Theory of Comput., pages 114-21. ACM Press, 1982.
15. J. Williams. Heapsort (Algorithm 232). Comm. Assoc. Comput. Mach., 7:347-48, 1964.