实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.