BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

1993/09/01 by Ingo Wegener · 3 citations
Computer Science · #Algorithms and Data Compression #Handwritten Text Recognition Techniques #semigroups and automata theory

paper · pdf · doi:10.1016/0304-3975(93)90364-y

crossref issued 1993/09/01 · crossref published 1993/09/01 · crossref published-print 1993/09/01 · openalex publication_date 1993/09/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2025/11/07 · openalex updated_date 2026/08/02

Citations

• Average-case results on heapsort
• A variant of heapsort with almost optimal number of comparisons
• Algorithm 245: Treesort

Cited by

• A tight lower bound for the worst case of Bottom-Up-Heapsort
• A numerical analysis of Quicksort: How many cases are bad cases?
• Heapsort [wikipedia]