《计算机程序设计艺术》英文版的。 尽情下吧！！！

计算机经典，Graham Knuth Patashnik合著离散数学。 C O N C R E T E MATHEMATICS Ronald L. Graham AT&T Bell Laboratories Donald E. Knuth Stanford University Oren Patashnik Stanford University

高德纳教授的 TEX经典书籍，排版类的好书籍 适合于数学排版和科技书籍排版

《计算机程序设计艺术》1,2,3卷--中文PDF电子书英文书名《The Art Of Computer Programming》第3版 Addison Wesley 国防工业出版社Donald E.Knuth著 苏运霖译第一卷 基本算法。。。第1章 基本概念。。。第2 章 信息结构第二卷 半数值算法。。。第3 章 随机数。。。第4章 算术第三卷 排序与查找。。。第5章 排序。。。第6章 查找采用RAR分卷压缩，共分成了5卷，这是第四部分，大家慢慢看吧：）

knuth大人写的书，csdn上另一个版本我怎么下不了 网上找了一个版本，作者声称是高质量版 反正不是扫描版都差不多，很清晰

具体数学 计算机科学基础（第2版）.pdf

The TeX Book Knuth原版

资源来自http://b-ok.org/，本人对相关版权等问题不了解，可联系删除 The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition) Donald E. Knuth This magnificent tour de force presents a comprehensive overview of a wide variety of algorithms and the analysis of them. Now in its third edition, The Art of Computer Programming, Volume I: Fundamental Algorithms contains substantial revisions by the author and includes numerous new exercises. Although this book was conceived several decades ago, it is still a timeless classic. One of the book's greatest strengths is the wonderful collection of problems that accompany each chapter. The author has chosen problems carefully and indexed them according to difficulty. Solving a substantial number of these problems will help you gain a solid understanding of the issues surrounding the given topic. Furthermore, the exercises feature a variety of classic problems. Fundamental Algorithms begins with mathematical preliminaries. The first section offers a good grounding in a variety of useful mathematical tools: proof techniques, combinatorics, and elementary number theory. Knuth then details the MIX processor, a virtual machine architecture that serves as the programming target for subsequent discussions. This wonderful section comprehensively covers the principles of simple machine architecture, beginning with a register-level discussion of the instruction set. A later discussion of a simulator for this machine includes an excellent description of the principles underlying the implementation of subroutines and co-routines. Implementing such a simulator is an excellent introduction to computer design. In the second section, Knuth covers data structures--stacks, queues, lists, arrays, and trees--and presents implementations (in MIX assembly) along with techniques for manipulating these structures. Knuth follows many of the algorithms with careful time and space analysis. In the section on tree structures, the discussion includes a series

资源来自http://b-ok.org/，本人对相关版权等问题不了解，可联系删除 The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition) Donald E. Knuth Volume 2 of Donald Knuth's classic series The Art of Computer Programming covers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures--a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers. The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus. Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text that's suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer's library.

大师 高德纳 (Donald E.Knuth)《具体数学：计算机科学基础(第 2版)》是一本在大学中广泛使用的经典数学教科书。书中讲解了许多计算机科学中用到的数学知识及技巧，教你如何把一个实际问题一步步演化为数学模型，然后通过计算机解决它，特别着墨于算法分析方面。其主要内容涉及和式、整值函数、数论、二项式系数、特殊的数、生成函数、离散概率、渐近式等，都是编程所必 备的知识。另外，《具体数学：计算机科学基础(第 2版)》包括了六大类500 多道习题，并给出了所有习题的解答，有助读者加深书中内容的理解。