next up previous
Next: Running Times Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and


In-place sort.

Running time: O(n lg n)



Heap: An array A representing a complete binary tree for HeapSize(A) elements satisfying the heap property:

for every node i except the root node.

Because the array may hold more numbers than are contained in the heap, HeapSize(A) $\leq$ length(A) (heap insertion and deletion)

Copyright © 1998 The University of Texas at Arlington