← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

16 第16章 摊还分析

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.702Z

method to analyze a dynamically expanding and contracting table. 16.1 Aggregate analysis

In aggregate analysis, you show that for all n, a sequence of n operations takes T (n) worst-case time in total.

In the worst case, the average cost, or amortized cost, per operation is therefore T (n)/

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea