Describe in words the mechanism of the HeapSort algorithm.

HeapSort is an algorithm for sorting a list $($e$.$g$.$ of numbers$).$ In the first phase it extracts the consecutive minima from a heap, creating

the sorted list. Then, in the second phase, it inserts the elements one by one into a heap, maintaining its minimum.

HeapSort is an algorithm for sorting a list $($e$.$g$.$ of numbers$).$ In the first phase it inserts the elements one by one into a heap, maintaining

its minimum. Then, in the second phase it extracts the consecutive minima from the heap, creating the final sorted list,

HeapSort is an algorithm for sorting a list $($e$.$g$.$ of numbers$).$ In the first phase it inserts the elements one by one into a heap, maintaining

its minimum. Then, in the second phase it extracts the consecutive maxima from the heap, creating the final sorted list.

HeapSort is an algorithm for sorting a list $($e$.$g$.$ of numbers$).$ In the first phase it inserts the elements one by one into an AVL tree,

maintaining its minimum. Then, in the second phase it extracts the consecutive minima from the AVL tree, creating the final sorted

list.

HeapSort is an algorithm for sorting a list $($e$.$g$.$ of numbers$).$ In the first phase it inserts the elements one by one into an AVL tree,

maintaining its maximum. Then, in the second phase it extracts the consecutive minima from the AVL tree, creating the final sorted

list.