Optimal In-place Sorting of Vectors and Records

Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm for lexicographically sorting n keys in O(nk+n log n) time using O(1) auxiliary data locations, which is simultaneously optimal in time and space.

• Type: Conference
• Year: 2005
• Where: ICALP
• Authors: Gianni Franceschini, Roberto Grossi
• Keywords: Auxiliary Data Locations, ICALP 2005, In-place Sorting, Theoretical Computer Science, first Algorithm