HCF -- Halt and Catch Fire

7.1-2; 7.3-2; 7-2(a,b,c); 8.1-1. Show that heapsort requires O(n) time to sort n identical elements. Why doesn't this contradict the bound for heapsort?

• About this document ...