A lower bound for the worst case of bottom-up-heapsort

DOI10.1006/inco.1993.1009zbMath0785.68045OpenAlexW2076116413MaRDI QIDQ1207959

Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig

Publication date: 16 May 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1009

zbMATH Keywords

worst case complexitybottom-up-heapsort

Mathematics Subject Classification ID

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

Related Items (1)

Optimizing binary heaps

This page was built for publication: A lower bound for the worst case of bottom-up-heapsort