Question

Suppose we are sorting an array of nine integers using heapsort, and we have just finished one of the reheapifications downward. The array now looks like this: 3 2 6 4 5 1 7 8 9 How many completed reheapification downward operations have been performed so far

Answer 1

Answer:

3

Explanation:

Heap sort pick an item from the first or last position in an array and compares it with other items in other positions in the array, swapping position if they meet the condition.

The array above has three maximum items arranged sequentially in the array, this is prove that there have been 3 reheapifications in the array.