A Poor Upper Bound We can compute a simple upper bound on the running time of BUILD-MAX- HEAP as follows.Each call to MAX-HEAPIFY costs O(lgn)time,and BUILD- MAX-HEAP makes O(n)such calls.Thus,the running time is O(nlgn).This upper bound,though correct,is not asymptotically tight. 间题7： 为什么这个Bound不很好？A Poor Upper Bound