原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
e falls under case 2 of the master theorem with k = 1, its solution is T∞(n) = Θ(lg 2 n).
Now let’s verify that the work T1(n) of P-MERGE-AUX on n elements is linear. A lower bound of Ω(n) is straightforward, since each of the n elements is copied from array A to array B. We’ll show that T1(n) = O(n) by
deriving a recurrence for the worst-case work. The binary search in line 8 costs Θ(lg n)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea