原书出处
Introduction to Algorithms, Fourth Edition
16 第16章 摊还分析
ted arrays A0, A1, … , Ak−1, where for i = 0, 1, … , k − 1, the length of array Ai is 2i.
Each array is either full or empty, depending on whether ni = 1 or ni = 0, respectively.
The total number of elements held in all k arrays is therefore . Although each individual
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter016.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea