Instructions:

Reproduce the behavior of heapsort for the maximum heap below. You can swap keys by clicking the first one and then the second one in either of the representations (array or binary tree). Begin by swapping the last key with the largest key, and reducing the size of the heap by one (by clicking the "Decrement heap size" button). After that, restore the heap property again.

Score: 0 / 32, Points remaining: 32, Points lost: 0

1. 800
2. 771
3. 702
4. 753
5. 624
6. 345
7. 656
8. 457
9. 138
10. 139