原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
e low side of the partition and then it recursively sorts the high side of the partition.
The second recursive call in QUICKSORT is not really necessary, because the procedure can instead use an iterative control structure.
This transformation technique, called tail-recursion elimination, is provided automatical
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea