原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
ut finding one that is compatible with ak. In this case, Sk = ∅, and so line 6 returns ∅.
Assuming that the activities have already been sorted by finish times, the running time of the call RECURSIVE-ACTIVITY-SELECTOR (s, f, 0, n) is Θ(n). To see why, observe that over all recursive calls, each activity is examined exactly once in the while loop test of line 2.
In particular, activity ai is examined in the last call made in which k < i. An iterative
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea