This algorithm is a Max Heap algorithm using an array.

Please give an array example of:

a) Size 15 for a best-case scenario for this algorithm.

b) Size 15 for a worst-case scenario for this algorithm.

Algorithm do something(int[] A: an array of N integers) for(int i = N/2; i >= 0; i--): foo(A, 1) end for end doSomething procedure foo(int[] a, int i) int L = 2*1+1 int r = 2*i+2 if ( >= A.Length && r >= A.Length: return if r >= A.Length && A[i] A[L] && A[r] > A[i]: swap A[i] and A[r] foo(A, r) else if A[L] > A[i]: swap A[i] and A[L] foo(A, L) end foo