原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
for quicksort as well, but a different randomization technique yields a simpler analysis.
Instead of always using A[r] as the pivot, a randomized version randomly chooses the pivot from the subarray A[p : r]
, where each element in A[p : r] has an equal probability of being chosen. It then exchang
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea