Queue-mergesort

DOI10.1016/0020-0190(93)90088-QzbMath0787.68030OpenAlexW2913944365MaRDI QIDQ1313731

Robert Sedgewick, Mordecai J. Golin

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90088-q

zbMATH Keywords

binary treessorting algorithmsHuffman encodingqueue-mergesort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Bottom-up mergesort -- A detailed analysis ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Unnamed Item ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Queue-mergesort ⋮ Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

Cites Work

• Queue-mergesort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Queue-mergesort