On the best case of heapsort

Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1996) On the best case of heapsort. Journal of Algorithms 20 (2), pp. 205-217. ISSN 0196-6774.

Full text not available from this repository.

Official URL: https://doi.org/10.1006/jagm.1996.0011

Abstract

Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. Here we investigate thebest caseof Heapsort. Contrary to claims made by some authors that its time complexity isO(n), i.e., linear in the number of items, we prove that it is actuallyO(nlogn) and is, in fact, approximately half that of the worst case. Our proof contains a construction for an asymptotically best-case heap. In addition, the proof and construction provide theworst-casetime complexity and an asymptotically worst-case example forBottom-upversions of Heapsort.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	22 Mar 2021 19:55
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43619

Statistics

Archive Staff Only (login required)

Edit/View Item