Typical computer science students study the basic sorting algorithms at least three times before they graduate: first in introductory programming, then in data structures, and finally in their algorithms course. (查看原文)
When you have morethan 100 items to sort, it is important to use an O(nlgn)-time algorithm like heapsort, quicksort, or mergesort.
... Once you get past (say) 5,000,000 items, it is important to start thinking about external-memory sorting algorithms that minimize disk access. (查看原文)
Compared with CLRS: - Both books are well written and way above the average. - "Almost" as great as the classic CLRS. - Not so textbook like which is both good and bad: - Has clearer statements about goals and abstractions of algorithms and data struct...
(展开)
看着看着时而就觉得不明白了 看到amazon上有人说 This book isn't always the easiest to understand.. . Consider the explanation of Djikstra's Algorithm on p. 206 of the 2nd ed: ... 我才放下心来. 他就是没讲明白么,真是的!
(展开)
wuyve
nuvole
Creasy
Springer2010版
0 有用 芒可猫 2022-06-14 16:04:36
@2020-03-28 00:27:24
2 有用 厚积薄发 2015-04-15 23:55:05
全！終生學習之用！感謝！🙏
0 有用 散装核弹和射线娃娃 2015-03-30 11:40:28
一般
5 有用 Asura 2014-04-28 17:14:17
本书内容层次分明、系统，由一开始的分类叙述，到书的后半部的算法列表的组合是同类书中不曾看过的。作者对于递归的运用如火纯清，是自己的递归思维上升了一个台阶。另外每一章节中的小故事切切实实起到了开拓视野的作用。
0 有用 松仓 2013-08-19 22:19:45
前半部用来查漏补缺不错，尤其是动态规划讲得很好。后半部还是留到需要的时候再翻翻吧，考虑的问题很有启发性。
0 有用 芒可猫 2022-06-14 16:04:36
@2020-03-28 00:27:24
2 有用 heisen 2019-04-30 16:41:25
readability着实不如英文版
2 有用 厚积薄发 2015-04-15 23:55:05
全！終生學習之用！感謝！🙏
0 有用 散装核弹和射线娃娃 2015-03-30 11:40:28
一般
0 有用 Wheyu 2014-12-07 15:47:08
程序员面试必备，尤其是回溯那一章讲的很明白。