## Each call to Heapify() takes O(lg n) time

## There are O(n) such calls (specifically, ?n/2?)

## Thus the running time is O(n lg n)

- Is this a correct asymptotic upper bound?
- Is this an asymptotically tight bound?

## A tighter bound is O(n)

- How can this be? Is there a flaw in the above reasoning?

Previous slide | Next slide | Back to first slide | View graphic version |