Hi

Im doing a presentation on Heap Sort, and it says that the it takes O(logn) to run, and since there are n items it is O(n*logn). But I have no idea how they get that it takes O(logn) to run in the first place.

Can anyone explain this to me?

- Ive searched a lot of websites, they all have O(logn) as run time, but never explain how they achieve it.

Thanks