The objective of this experiment is to generate a sorted list of numbers in ascending order from a Max Heap.
The HeapSort Interactive experiment consists of a Max Heap. Using the insight that the root node of a Max heap has the the greatest value, generate a sorted list of numbers from the nodes of Max heap in ascending order by continously performing one of the three operations.
Clicking on "Swap" button swaps the value of the first and the last node which are highlighted in red color.
Clicking on "Pop and Append" button removes the last node from the tree and adds it to the front of the generated list.
Clicking on "Heapify Root" button performs heapify subtree procedure at the root node(As in Experiment "Heapify Subtree").
Sorted list appears in green background while unsorted list appears in red background.