原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
X by n1/2 + n2 = (2n1 + 4n2)/4 ≤ (3n1 + 3n2)/4 (since n2 ≤ n1) = 3n/4, proving the claim.
The worst-case span of P-MERGE-AUX can therefore be described by the following recurrence: Because this recurrence 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 boun
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea