算法分析与设计2004春.课件.第06讲【荐】.pdfVIP

第六讲：分摊分析法 Amortized Analysis 宋斌恒 清华大学宋斌恒 1 Overview • Aggregate analysis • The accounting method • The potential method • Example: – Dynamic tables 清华大学宋斌恒 2 Overview • Problems solved by Amortized Analysis – Sequence of operation on a dada structure – Average cost per operation – 【比如网站的整体效率问题与此问题的关系】 • Three main analysis methods – Aggregate, worst case + average – Accounting, Amortized cost – Potential, is a whole index for the data structure 清华大学宋斌恒 3 Aggregate analysis • A sequence of n operations takes worst- case time T(n) in total • The average cost T(n)/n is called the amortized cost, • the amortized cost applies to each operation, even they are different. 清华大学宋斌恒 4 Stack operation • Let S be a stack object, it has two basic operations: – Pop() – Push() • Adding another operation – MultiPop(k), which pops k elements at once, its cost is at most k pop()’s cost • Attention: what it occurs when S.getSize()k? 清华大学宋斌恒 5 Coarse analysis • In the worst case of these operations, the worst cost is n, the size of the dada structure; • A sequence of m operations cost at most m*n • The amortized cost of the operations is less than O(n) • It is right but not tight! 清华大学宋斌恒 6 Aggregate analysis • Consider the entire seq