HEAPSORT( array A, int n)

1 BUILD-HEAP(A, n)

2 m n

3 while (m 2)

4 do SWAP(A[1],A[m])

5 m m− 1

6 HEAPIFY(A, 1,m)

Considering the pseudo code of Heap Sort discussed in lecture answer the following

questions (you need to justify your answers as well),

a. What will be the running time of Heap Sort if input is sorted in ascending

order

b. What will be the running time of Heap Sort if input is sorted in descending

order

c. What is best case input (format of input resulting in best case time) for Heap

Sort.

1 BUILD-HEAP(A, n)

2 m n

3 while (m 2)

4 do SWAP(A[1],A[m])

5 m m− 1

6 HEAPIFY(A, 1,m)

Considering the pseudo code of Heap Sort discussed in lecture answer the following

questions (you need to justify your answers as well),

a. What will be the running time of Heap Sort if input is sorted in ascending

order

b. What will be the running time of Heap Sort if input is sorted in descending

order

c. What is best case input (format of input resulting in best case time) for Heap

Sort.

### Recently Asked Questions

- How can i make the set of a,b,c repeat 3 times( as in triplicate of a,b,c) %Pythagorean Triplet %Find the two Pythagorean Triplets for which a + b + c = n % a,

- how ineffective communication and resource constraints can impact on time-management within projects?

- how do I find four ordered pair solutions by completing the table and then use the ordered pairs in a graph for y = 1/3x -1 with x y -3 0 0 1 2.I need help