数据结构中堆排序的代码实现。堆排序就是首先建立一个小顶堆或是大顶堆，然后把堆中最大的放到数组最后，再建立堆，再放到数组后面的位置-Data structure in the heap sort code. Heap sort is to first establish a small cap pile or pile top, and then put the heap s largest array in the end, to build pile, put them behind the array position