Adaptive Heapsort

DOI10.1006/JAGM.1993.1021MaRDI QIDQ4696648zbMATH OpenOpenAlexFDO

Authors Ola Petersson, Christos Levcopoulos

Publication date 29 June 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1021

zbMATH Keywords

adaptive heapsortoscillationpresortednesssweepline

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 140492
• An adaptive generic sorting algorithm that uses variable partitioning^∗
• A framework for adaptive sorting
• A framework for adaptive sorting
• A general method for improving insertion-based adaptive sorting

Cited in

(12)

• Exploiting few inversions when sorting: Sequential and parallel algorithms
• A framework for adaptive sorting
• The weak-heap data structure: variants and applications
• Optimizing binary heaps
• Adaptive sorting: an information theoretic perspective
• scientific article; zbMATH DE number 140492 (Why is no real title available?)
• Self-Adjusting Heaps
• Parameterized self-adjusting heaps
• A framework for adaptive sorting
• On the adaptiveness of Quicksort
• Estimating the Error of a Permutational Central Limit Theorem
• Fast and simple sorting using partial information

This page was built for publication: Adaptive Heapsort

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