Worst-case analysis of a generalized heapsort algorithm

DOI10.1016/0020-0190(90)90086-DMaRDI QIDQ917307zbMATH OpenFDO

Authors Augustin Paulik

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0020-0190(90)90086-D

zbMATH Keywords

asymptotical behaviord-heaptime requirement functionworst-case analysis of d-heapsort

Mathematics Subject Classification ID

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

Recommendations

• Worst-case analysis of generalized heapsort algorithm revisited
• A variant of heapsort with almost optimal number of comparisons
• A Note on HEAPSORT
• Sorting using heap structure
• scientific article; zbMATH DE number 1629827

Cited in

(9)

• 3 is more promising algorithmic parameter than 2
• Smoothsort revisited
• Best case lower bounds for heapsort
• Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
• scientific article; zbMATH DE number 1629827 (Why is no real title available?)
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• Worst-case analysis of generalized heapsort algorithm revisited
• M-Heap: A Modified Heap Data Structure
• Heap construction: Optimal in both worst and average cases?

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: Worst-case analysis of a generalized heapsort algorithm

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