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

DOI10.1145/1082036.1082037zbMath1323.68246OpenAlexW2138309540MaRDI QIDQ3546298

Viliam Geffert, Gianni Franceschini

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1082036.1082037

zbMATH Keywords

in-place sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (5)

Multiway in-place merging ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ In-Place Sorting ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo) ⋮ Complexity analysis and performance of double hashing sort algorithm

This page was built for publication: An in-place sorting with O ( n log n ) comparisons and O ( n ) moves