原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
al projection of P-NAIVE-MERGE-SORT is exactly MERGE-SORT, its work is T1(n) = Θ(n lg n).
The two recursive calls in lines 5 and 7 run in parallel, and so its span is given by the recurrence T∞(n) = T∞(n/2) + Θ(n) = Θ(n), by case 1 of the master theorem. Thus the parallelism of P-NAIVE-MERGE-SORT is T1(n)/T∞(n) = Θ(lg n), which is an unimpressive amount of parallelism.
To sort a million elements, for example, since lg 106 ≈ 20, it might achieve linear speed
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea