Show that within the pseudocode for the method heapsort you can replace the statement
for(index = n-1 down to 0)
with
for(index = n/2 down to 0)
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.