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 ...)
Aggregate child (... is a part of or used in me.)
Note: After [CLR90, page 145].
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 20 September 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "build-heap", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 20 September 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/buildHeap.html