Queue-mergesort

DOI10.1016/0020-0190(93)90088-QMaRDI QIDQ1313731zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The heap-mergesort
• Algorithm Theory - SWAT 2004
• Melding priority queues
• Mergeable double-ended priority queues
• Range-restricted mergeable priority queues
• Parallel Merge Sort
• Sorting by shuffling methods and a queue
• Fast meldable priority queues
• Priority Queues and Permutations
• Worst-case efficient sorting with QuickMergesort

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3343675 (Why is no real title available?)
• Queue-mergesort

Cited in

(8)

• An asymptotic theory for recurrence relations based on minimization and maximization.
• Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
• Queue-mergesort
• Sorting by shuffling methods and a queue
• QuickXsort: a fast sorting scheme in theory and practice
• Bottom-up mergesort -- A detailed analysis
• Reordering an existing queue
• scientific article; zbMATH DE number 7378733 (Why is no real title available?)

This page was built for publication: Queue-mergesort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313731)