Sciweavers

ICALP
2005
Springer
14 years 28 days ago
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...
Gianni Franceschini, Roberto Grossi