 Once the data list has been made into a heap, the root node is guaranteed to be the largest (or smallest) element.When it is removed and placed at the end of the list, the heap is rearranged so the largest element remaining moves to the root.Using the heap, finding the next largest element takes O(log "n") time, instead of O("n") for a linear scan as in simple selection sort.