原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
o determine the best choices is overkill, and simpler, more efficient algorithms will do.
A greedy algorithm always makes the choice that looks best at the moment. That is, it makes a locally optimal choice in the hope that this choice leads to a globally optimal solution.
This chapter explores optimization problems for which greedy algorithms provide optimal s
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea