View the step-by-step solution to:

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

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.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

-

Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question