原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
eater-than” relation.) We define the inverse of the function Ak(n), for integer n ≥ 0, by
In words, α(n) is the lowest level k for which Ak(1) is at least n. From the above values of Ak(1), we see that It is only for values of n so large that the term “astronomical” understates them (greater than A4(1), a huge number) that α(n) > 4, and so α(n) ≤ 4 for all practical purposes.
Properties of ranks In the remainder of this section, we prove an O(mα(n)) bound on the r
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea