Heapsort (11)
1. Heapify the tree: beginning with the last parent and working toward the root, perform Bubble down. (if the node has a value greater than that of a child, change places with the smaller child, and if necessary, repeat this until the value sinks as far down as necessary to achieve the heap property.)