摘要： 堆排序（Heapsort）维基百科：http://en.wikipedia.org/wiki/Heapsort时间复杂度：O(nlogn)示例：[6, 5, 3, 1, 8, 7, 2, 4]1、堆（Heap）维基百科：http://en.wikipedia.org/wiki/Heap_(data_structure)Incomputer science, aheapis a specializedtree-baseddata structurethat satisfies theheap property:IfAis a parentnodeofBthen key(A) is ordered 阅读全文