CS 2401 Quiz Based on Test #3

Date: Monday, May 2, 2011.

Name: ___________________________________________________________________

9-10. Show how the heapsort algorithm sorts the list consisting of the elements 4, 28, 20, and 11: first make it a heap, and then convert, step by step, the resulting heap into a sorted list. What is the worst-case computational complexity of heapsort? How does it compare with other sorting algorithms that you know?