原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
al of the final configuration, and the maximum change in potential ΔΦmax due to any step.
The number of steps must therefore be at least |Φfinal − Φinit| / | ΔΦmax|.
Examples of potential functions to prove lower bounds in I/O complexity appear in works b
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea