原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
= Θ(n lg n)/Θ(lg3 n) = Θ(n/lg2 n), which is much better, both in theory and in practice.
A good implementation in practice would sacrifice some parallelism by coarsening the base case in order to reduce the constants hidden by the asymptotic notation. For example, you could switch to an efficient serial sort, perhaps
quicksort, when the number of elements to be sorted is sufficiently small. Exercises 26.3
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea