原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
was the correct action. Lines 3–7 attempt to skip ahead to a randomly chosen position j.
Such a skip helps if key[j] is larger than key[i] and no larger than k.
In such a case, j marks a position in the list that i would reach during an ordinary list
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea