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
Default User
Springer2011版（其他版本）
Creasy
Springer2010版（其他版本）
0 有用 zhilushi 2022-06-14 16:04:36
@2020-03-28 00:27:24
1 有用 lin 2025-01-07 16:57:53 加拿大
https://wqbook.wqxuetang.com/deep/read/pdf?bid=4118 不是中文译本
2 有用 厚积薄发 2015-04-15 23:55:05
全！終生學習之用！感謝！🙏
1 有用 Wheyu 2014-12-07 15:47:08
程序员面试必备，尤其是回溯那一章讲的很明白。
2 有用 大庶 2025-05-25 22:03:44 安徽
实用性强，面试必备，涵盖常见算法问题及优化技巧