BIROn - Birkbeck Institutional Research Online

    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.

    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: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 22 Mar 2021 19:55
    Last Modified: 22 Mar 2021 19:55
    URI: https://eprints.bbk.ac.uk/id/eprint/43619

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    44Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item