Multiway in-place merging

DOI10.1016/j.tcs.2010.01.034zbMath1191.68223OpenAlexW1995461012MaRDI QIDQ964398

Viliam Geffert, Jozef Gajdoš

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.034

zbMATH Keywords

sortingmergingin-place algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (2)

Algorithms for Colourful Simplicial Depth and Medians in the Plane ⋮ Lightweight BWT and LCP Merging via the Gap Algorithm

Uses Software

• heapsort

Cites Work

• Unnamed Item
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• On a stable minimum storage merging algorithm
• Optimizing stable in-place merging.
• In-place sorting with fewer moves
• The Analysis of Heapsort
• Multiway In-Place Merging
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• A Note on HEAPSORT
• Sorting by Merging or Merging by Sorting?
• Asymptotically efficient in-place merging

This page was built for publication: Multiway in-place merging