Thank you both of you for the help. I did the Analysis of Algortihms
course 3 years ago, but have to take an exam in it now , so finding it
hard to get back to it, especially while working and not having anybody
to discuss with.
I appreciate your taking time.
Thanks.
--~--~-~--~~--
shooshweet wrote:
> Hi,
>
> Can somebody please help me understand Heap Sort. How to build a heap
> and how can I prove that the worst case is nlogn?
>
>
> Thank you for your help.
Not too long ago I stumbled across a website that has some good stuff,
including one of the clearest descriptions of
I'm not sure what it is specifically that you don't understand. Can you
post some code and specificy what it is you're not clear about?
Does this help?
Heap Sort
---
Algorithm Analysis
The heap sort is the slowest of the O(n log n) sor
