The question is intended as a self-test for readers. Answers may be found in Appendix C.
Heapsort involves
a. removing data from a heap and then inserting it again.
b. inserting data into a heap and then removing it.
c. copying data from one heap to another.
d. copying data from the array representing a heap to the heap.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.