原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
TIPOP operations on an initially empty stack has an upper bound on its cost of O(n). Why?
An object cannot be popped from the stack unless it was first pushed.
Therefore, the number of times that POP can be called on a nonempty stack, including call
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea