「Heap Sort」的原理

Heap is explained in 維基百科
http://zh.wikipedia.org/wiki/堆
The Wiki explanation of heaps is a little more graphical in English
http://en.wikipedia.org/wiki/Heap_(data_structure)

Heap sort is nothing more than creating a heap, and then removing the root element one by one, and automatically it is in ascending order.
The part of heap sort that is harder to understand is maintaining a heap in place, as in an array. This is explained again in 維基百科
http://zh.wikipedia.org/wiki/堆積排序
or in English, it is explained in more detail:
http://en.wikipedia.org/wiki/Heapsort

If you need more details, I can give you more specific explanations. As I am limited to 3 posts a day and 300 characters in subsequent posts, it is easier if you could post me your e-mail address to communicate directly.