Data Structures and Algorithms Lecture Notes
18 April 2011 • Faster Sorting
With a bit more care, and a divide-and-conquer algorithm, it’s possible to show that heapifying can be done with
O
(
n
) work.
This page last modified on 2006 January 24.