说明：  堆排序（英语：Heapsort）是指利用堆这种数据结构所设计的一种排序算法。堆是一个近似完全二叉树的结构，并同时满足堆积的性质：即子结点的键值或索引总是小于（或者大于）它的父节点。
(Heapsort (English: HeapSort) refers to a sort algorithm designed using the data structure heap. The heap is an almost complete binary tree structure, and simultaneously satisfies the property of the heap: that is, the key or index of a child node is always smaller than (or greater than) its parent node.)