In-Place Sorting

DOI10.1007/978-3-642-18381-2_21zbMath1298.68074OpenAlexW1571624017MaRDI QIDQ3075523

Viliam Geffert, Jozef Gajdoš

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_21

zbMATH Keywords

computational complexitysortingin-place algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

Unnamed Item

Cites Work

• Selection from read-only memory and sorting with minimum data movement
• Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• Sorting with minimum data movement
• Unnamed Item
• Unnamed Item

This page was built for publication: In-Place Sorting