rar

10.34③ It is known that (k1, k2, ..., kp) is a heap

  • 2014-03-05
  • 2.57KB
  • Points it Requires : 2

10.34③ If (k1, k2, ..., kp) is a heap, then we can write an algorithm with a time complexity of O(log(n)) to adjust (k1, k2, ..., kp, kp+1) to a heap. Try to write an algorithm of \"starting from p=1, insert one by one to build a heap\", and discuss the time complexity of building a heap by this method.

unfold

You Might Like

Uploader
PKelect
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×