Heapsort strategy: based on selection or interchange?

Question

I cannot decide what approach would be more appropriate to HeapSort. The fact that selects the root or that it changes it with the last element? What from these two would be