مرتب‌سازی هرمی

In computer science, heapsort is an efficient, comparison-based sorting algorithm that reorganizes an input array into a heap (a data structure where each node is greater than its children) and then repeatedly removes the largest node from that heap, placing it at the end of the array in a similar manner to Selection sort.

Key facts

Algorithm.caption: A run of heapsort sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting takes place, the heap tree structure is shown briefly for illustration.
Algorithm.data: Array
Algorithm.time: O(n\log n)
Algorithm.average time: O(n\log n)
Algorithm.best time: O(n\log n) (distinct keys)or O(n) (equal keys)
Algorithm.space: O(n) total O(1) auxiliary
Algorithm.class: Sorting algorithm
Algorithm.image: File:Sorting heapsort anim.gif