EXAM second set

Question 1

Given an array A[0]….A[n-1] of n integers, give the pseudocode to turn this array into a max heap. (You may not use an extra array.) Then justify that turning an array into a heap by your algorithm, takes linear time in the worst case. What is be the best-case running time of your algorithm? Justify your answers

Answer 1

HW 4 Problem