Heap排序法让搜寻的路径由树根至最后一个树叶，而不是整个未排序部份，因而称之为改良的选择排序法。-Heap sort to make a path the root to search for the last one leaves, rather than the entire unsorted part, which is called a modified selection sort.