Re: HEAP SORT

On Fri, 24 Feb 2006 13:35:50 -0800, Radha wrote:

Thank you Chris and Ben. I need to write a proof that the worst case is
O(nlogn). I was hoping somebody could help me with that.

Sounds like a teaching exercise. Your library should have at least one
book with such a proof. I used to use Aho, Hopcroft and Ullman: "The
Design and Analysis of Computer Algorithms" but there must be 100s of
texts with such a proof in them.

--
Ben.

.