Stable in situ sorting and minimum data movement

DOI10.1007/BF02017344zbMath0696.68086OpenAlexW1964495281MaRDI QIDQ911311

Venkatesh Raman, Jeffrey S. Salowe, J. Ian Munro

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02017344

zbMATH Keywords

minimum data movementstable in situ sorting

Mathematics Subject Classification ID

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

Related Items (5)

Sorting multisets stably in minimum space ⋮ Space-efficient planar convex hull algorithms ⋮ Stable minimum space partitioning in linear time ⋮ Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time ⋮ Sorting multisets stably in minimum space

Uses Software

• Quicksort

Cites Work

• A generalized, one-way, stackless quicksort
• Stable unmerging in linear time and constant space
• Transposing Matrices in a Digital Computer
• Simplified stable merging tasks
• Stable Sorting and Merging with Optimal Space and Time Bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable in situ sorting and minimum data movement