(algorithm)
Definition: Convert an array into a heap by executing heapify progressively closer to the root. For an array of n nodes, this takes O(n) time under the comparison model.
Aggregate parent (I am a part of or used in ...)
heapsort, JSort.
Aggregate child (... is a part of or used in me.)
heapify.
Note: After [CLR90, page 145].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 September 2006.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "build-heap", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 September 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/buildHeap.html