1993 Wegener "Bottom-up-heapsort, a new variant of heapsort, beating, on average, quicksort (if n is not very small)", Theoretical Computer Science 118, pages 81–98, is the same as Floyd's bottom-up algorithm in Knuth exercise 5.2.3-18.
Version: This is version 2023.11.26 of the "Bottom-up heapsort" web page.