Worst-case analysis of a generalized heapsort algorithm

DOI10.1016/0020-0190(90)90086-DzbMath0704.68056MaRDI QIDQ917307

Augustin Paulik

Publication date: 1990

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (5)

An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons ⋮ 3 is more promising algorithmic parameter than 2 ⋮ M-Heap: A Modified Heap Data Structure ⋮ Worst-case analysis of generalized heapsort algorithm revisited ⋮ Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

Uses Software

• heapsort

Cites Work

• Unnamed Item
• Unnamed Item

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