選擇排序法的概念簡單，每次從未排序部份選一最小值，插入已排序部份的後端，其時間主要花費於在整個未排序部份尋找最小值，如果能讓搜尋最小值的方式加快，選擇排序法的速率也就可以加快，Heap排序法讓搜尋的路徑由樹根至最後一個樹葉，而不是整個未排序部份，因而稱之為改良的選擇排序法。-Select sort method simple in concept, each part of the election has never been one to sort the minimum, insert has some sort of back-end, spent their time mainly in the unsorted part of the whole search for the minimum, if allowed to search for the minimum value of ways to speed up, select the sort method can also speed up the rate, Heap sort method so that the search path from the root to the last one leaves, not the whole part of unsorted and thus referred to as the choice of ordering method improved.