Mark Allen Weiss 数据结构与算法分析 课后习题答案11.pdfVIP

Chapter 11: Amortized Analysis 11.1 When the number of trees after the insertions is more than the number before. 11.2 Although each insertion takes roughly log NO , and each DeleteMinO takes 2log NO actual time, our accounting system is charging these particular operations as 2 for the insertion and 3log NO−2 for the DeleteMin.O The total time is still the same; this is an accounting gimmick. If the number of insertions and DeleteMinsO are roughly equivalent, then it really is