原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
t subarrays are sorted, P-MERGE-AUX can quickly determine a pivot that always works well.
Specifically, the recursive merging algorithm picks the pivot x as the middle element of the larger of the two input subarrays, which we can assume without loss of generality is A[p1 : r1], since otherwise, the two subarrays can just switch roles.
That is, x = A[q1], where q1 = ⌊(p1 + r1)/2⌋. Because A[p1 : r1] is sorted, x is a median
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea