But I think it can-->
所在版块：求学狮城 发贴时间：2003-11-14 16:24

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
For example, for an array based min heap, inserting a value larger than the maximum of original heap will tabke O(1) time if bottom-up algorithm is applyied


Correct me if i am wrong
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!

　相关帖子 我要回复↙ ↗回到正文
a question about running time: － 最近不太好 　2003-11-11 16:56 (339 bytes , 613reads )
binary heap cannot perform insert in O(1). － Flying 　2003-11-14 15:20 (64 bytes , 240reads )
But I think it can--> － cigar 　2003-11-14 16:24 (183 bytes , 233reads )
sorry...I didn't notice the "best-case time" there － Flying 　2003-11-14 17:20 (76 bytes , 227reads )
My thoughts--> － cigar 　2003-11-11 20:57 (300 bytes , 238reads )
Correction: for max heap, delete mim should be － cigar 　2003-11-11 21:04 (56 bytes , 304reads )