原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
hod, we return once again to the example of the stack operations PUSH, POP, and MULTIPOP.
We define the potential function Φ on a stack to be the number of objects in the stack.
The potential of the empty initial stack D0 is Φ(D0) = 0. Since the number of objects in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea