Question: I've already done part A - please help me out with part B. Question 10 (a) Is an array that is sorted in decreasing order

I've already done part A - please help me out with part B.
Question 10 (a) Is an array that is sorted in decreasing order a max-oriented heap? Justify your answer. [5 marks] (b) For N=16, give arrays of items that make heapsort use the most number of compares, and the least number of compares. Explain your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
