Sublinear merging and natural mergesort

DOI10.1007/BF01190160zbMath0797.68042MaRDI QIDQ2366243

Ola Petersson, Christos Levcopoulos, Svante Carlsson

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

sortingmergingmeasures of instance easiness

Mathematics Subject Classification ID

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

Related Items (5)

A framework for adaptive sorting ⋮ Splitsort -- an adaptive sorting algorithm ⋮ Adaptive sorting: an information theoretic perspective ⋮ Sorting shuffled monotone sequences ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures

Cites Work

• How good is the information theory bound in sorting?
• A framework for adaptive sorting
• Measures of Presortedness and Optimal Sorting Algorithms
• Sorting, trees, and measures of order
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sublinear merging and natural mergesort