The Art of Computer Programming, Volumes 1-3 Boxed Set - Donald E. Knuth

The Art of Computer Programming, Volumes 1-3 Boxed Set

Donald E. Knuth

出版时间

1998-10-15

ISBN

9780201485417

评分

★★★★★
书籍介绍
This multivolume work is widely recognized as the definitive description of classical computer science. The first three volumes have for decades been an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. --Byte, September 1995 Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home! and even at a Little League game when my son wasn't in the line-up. --Charles Long Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end.A programmer in China even compared the experience to reading a poem. If you think you're a really good programmer! read [Knuth's] Art of Computer Programming! You should definitely send me a resume if you can read the whole thing. --Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. --Jonathan Laventhol For the first time in more than 20 years, Knuth has revised all three books to reflect more recent developments in the field. His revisions focus specifically on those areas where knowledge has converged since publication of the last editions, on problems that have been solved, on problems that have changed. In keeping with the authoritative character of these books, all historical information about previous work in the field has been updated where necessary.Consistent with the author's reputation for painstaking perfection, the rare technical errors in his work, discovered by perceptive and demanding readers, have all been corrected. Hundreds of new exercises have been added to raise new challenges. 0201485419B04062001
AI导读
核心看点
  • 计算机科学圣经,奠定算法理论基础
  • 内容严谨深奥,融合数学与编程艺术
  • 涵盖经典算法分析,适合长期查阅
适合谁读
  • 计算机科学专业学生及研究人员
  • 追求极致算法优化的资深程序员
  • 对计算理论有浓厚兴趣的爱好者
读前提醒
  • 无需精通高等数学,微积分基础即可
  • 建议先略读数学部分,结合实例理解
  • 当作工具书查阅,不必强求通读全文
读者共识
  • 公认的经典巨著,字字珠玑,地位崇高
  • 难度极高,阅读过程痛苦,劝退新人
  • 虽难读懂,但能深刻体悟编程之美

本导读基于书籍简介、目录、原文摘录、短评和书评生成,不等同于全文精读。

精彩摘录
  • "A knowledge of elementary calculus will suffice for most of the mathematics in these books, since most of the other theory that is developed herein. However, I do need to use deeper theorems of complex variable theory, probability theory, number theory, etc., at times, and in such cases I refer to a"
  • "3。[20](为了提高效率)修改算法E,使其避免出现m←n之类的平凡替换操作。按照算法E的风格写出这个新算法,将其称为算法F。"
  • "An algorithm must be seen to be believed, and the best way to learn what an algorithm is all about is to try it."
  • "The design of computer representations depends on the desired function as well as on its intrinsic properties."
  • "6。「20]当n=5时,执行算法卫步骤E1的平均次数T5是多少?"
  • "重要注记:尽管下面几小节会就计算机算法研究中所需的数学技巧提供相当广泛的练习,但是大多数读者不会一看便知它们同计算机程序设计之间有怎样的紧密联系(1.2.1节除外)读者可以选择仔细阅读下面几小节,相信我的断言,这里讨论的主题极其相关。但是为了更有学习动力,更可取的方式或许是首先略读这一节,而后(等到在后几章见过各种计算方法的大量应用之后)再返回来进行更深入的学习。读者如果在首次阅读本书时在这里花费过多时间,那么可能一直学不到计算机程序设计的部分!然而,读者至少应该熟悉下面几小节的大体内容,即便是在首次阅读也应该尝试求解几道习题。应当特别注意1.2.10节,因为它是后面大部分理论内容的起点。1."
  • "我们可以把这个方法看成一个算法式证明过程。事实上,如果已经确立上面的步骤(a)和(b),那么下述算法对于任意正整数n,都能产生P(n)为真的证明。"
作者简介
http://en.wikipedia.org/wiki/Donald_Knuth http://www-cs-faculty.stanford.edu/~knuth/
用户评论
沒看完也是肯定的
随机和算法 流畅的娓娓道来 闲暇沉静的时候有必要细读
未读完,放弃。
断断续续翻了一点,累。
神作! 这本书诞生了数据结构这门学科
过于高端
最经典的算法巨著 也是克努特毕生的代表作 字字玑珠
让我体悟到了看似枯燥的程序其实是一种优美的艺术
收藏