反馈文件质量
upload/bibliotik/T/The Art of Computer Programming Volume 2 (3rd Edition) - Donald E. Knuth.pdf
The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition) 2 🔍
Donald E. Knuth. Vol.2, Seminumerical algorithms Addison-Wesley Professional, 3rd Edition, 1998
英语 [en] · PDF · 7.4MB · 1998 · 📘 非小说类图书 · 🚀/lgli/lgrs/upload/zlib · Save
描述
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
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
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
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
The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.
Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org
**
备用文件名
upload/motw_shc_2025_10/shc/The Art of Computer Programming - Donald E. Knuth.pdf
备用文件名
motw/The Art of Computer Programming - Donald E. Knuth.pdf
备用文件名
lgli/Knuth, Donald - Art of Computer Programming, Volume 2: Seminumerical Algorithms (1997, Addison-Wesley Professional).pdf
备用文件名
lgrsnf/The Art of Computer Programming Vol. 2 - Seminumerical Algorithms 3rd Edition.pdf
备用文件名
zlib/Computers/Programming/Knuth, Donald/Art of Computer Programming, Volume 2: Seminumerical Algorithms_11998155.pdf
备选标题
The art of computer programming. 4A : Part 1. Combinatorial algorithms : [the classic work extended and refined]
备选标题
Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1
备选标题
Art of Computer Programming, The: Combinatorial Algorithms, Volume 4A, Part 1
备选标题
The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd Edition
备选标题
The Art of Computer Programming, Volume 4A & 4B: Combinatorial Algorithms
备选标题
Art of Computer Programming, The : Fundamental Algorithms, Volume 1
备选标题
Art of Computer Programming, The : Volume 3: Sorting and Searching
备选标题
The Art of Computer Programming, Volume 1: Fundamental Algorithms
备选标题
The art of computer programming: Combinatorial algorithms, Part 1
备选标题
The Art of Computer Programming, Volume 3: Sorting and Searching
备选标题
The art of computer programming. Vol. 1, Fundamentals algorithms
备选标题
Art of computer programming: combinatorial algorithms, part one
备选标题
Art of Computer Programming, The : Seminumerical Algorithms
备选标题
Искусство программирования: пер. с англ
备选标题
Sorting and Searching. 2. Edition
备选标题
Получисленные алгоритмы: Т. 2
备选标题
Основные алгоритмы: Т. 1
备选标题
Сортировка и поиск: Т. 3
备选作者
Дональд Э. Кнут; [пер. с англ. и ред. И. В. Красикова]
备选作者
Donald Ervin Knuth (Mathematiker)
备选作者
Donald E. Knuth, Donald Knuth
备选作者
[by] Donald E. Knuth
备选作者
Knuth, Donald Ervin
备选作者
Кнут, Дональд Эрвин
备用出版商
Da Capo Press, Incorporated
备用出版商
Addison-Wesley Pub. Co.
备用出版商
Диалектика; Диалектика
备用出版商
Hachette Books
备用出版商
Basic Books
备用出版商
Вильямс
备用出版商
Pearson
备用版本
Addison-Wesley series in computer science and information processing, Reading, Mass, Massachusetts, 1973
备用版本
Addison-Wesley series in computer science and information processing, 2d ed, Reading, Mass, ©1973
备用版本
Addison-Wesley series in computer science and information processing, 3rd ed, Reading, Mass, 1998
备用版本
Классический труд. Новое издание, Москва [и др.], Санкт-Петербург, Russia, 2020
备用版本
Классический труд. Новое издание, Москва [и др.], Russia, 2015
备用版本
Классический труд, Новое издание, Москва [и др.], Russia, 2013
备用版本
Pearson Education (US), Upper Saddle River, New Jersey, 2011
备用版本
3rd ed., Reading, Mass, Harlow, England, 1998
备用版本
3rd ed., Reading, Mass, Massachusetts, 1997
备用版本
Upper Saddle River, NJ, New Jersey, 2011
备用版本
3rd ed (Online-ausg.), Boston, MA, 1997
备用版本
United States, United States of America
备用版本
2nd ed, Reading Mass. ; Harlow, ©1998
备用版本
Pearson Education (US), Boston, 2024
备用版本
Pearson Education (US), [N.p.], 2014
备用版本
Pearson Education (US), [N.p.], 1998
备用版本
Upper Saddle River, NJ, 2005
备用版本
Reading, Mass, ©1997-<2022>
备用版本
Second Edition, PS, 1998
备用版本
Third Edition, PS, 1997
备用版本
2nd ed., England, 1998
备用版本
3. изд., Russia, 2000
备用版本
2. изд., Russia, 2000
备用版本
1, 2011-01-12
备用版本
1, PS, 2011
元数据中的注释
lg_fict_id_1286384
元数据中的注释
producers:
MSP - Mathematical Sciences Publishers
元数据中的注释
Memory of the World Librarian: Slowrotation
元数据中的注释
Vol. 3 published as 2nd ed.
Includes indexes.
元数据中的注释
Includes bibliographical references and index.
元数据中的注释
Previous ed.: 1968.
The 2nd ed. of vol. 3 is part of the same printing as the 3rd ed. of vols. 1 and 2.
Includes bibliographic references and indexes.
元数据中的注释
Previous ed.: 1981.
Includes bibliographical references and index.
元数据中的注释
Includes index.
元数据中的注释
РГБ
元数据中的注释
Russian State Library [rgb] MARC:
=001 000672212
=003 RuMoRGB
=005 20001124120000.0
=008 001016s2000\\\\ru\||||\\\\\\\|00\u\rus\d
=017 \\ $a 00-41824 $b РКП
=020 \\ $a 5-8459-0080-8 (рус.)
=020 \\ $a 0-201-89683-4 (англ.)
=035 \\ $a (RuMoRGB)KNO-0123928
=040 \\ $a RuMoRGB $b rus $c RuMoRGB
=041 0\ $a rus
=084 \\ $a З973.2-018я22 $2 rubbk
=245 00 $a Основные алгоритмы $n Т. 1
=250 \\ $a 3. изд.
=260 \\ $c 2000
=300 \\ $a 712 с. $b ил., табл.
=773 18 $7 p1am $g Т. 1 $a Кнут, Дональд Эрвин $t Искусство программирования / Дональд Э. Кнут; Под общ. ред. Ю. В. Козаченко $d М. [ др.] : Вильямс, 2000-____ $h 24 см $k (Классический труд) $w 000848411
=852 \\ $a РГБ $b FB $j 12 00-3/253-9 $x 90
=852 \\ $a РГБ $b FB $j 12 00-3/254-7 $x 90
元数据中的注释
Russian State Library [rgb] MARC:
=001 000672216
=003 RuMoRGB
=005 20001124120000.0
=008 001016s2000\\\\ru\||||\\\\\\\|00\u\rus\d
=017 \\ $a 00-41823 $b РКП
=020 \\ $a 5-8459-0082-4 (рус.)
=020 \\ $a 0-201-89685-0 (англ.)
=035 \\ $a (RuMoRGB)KNO-0123932
=040 \\ $a RuMoRGB $b rus $c RuMoRGB
=041 0\ $a rus
=084 \\ $a З973.2-018я22 $2 rubbk
=245 00 $a Сортировка и поиск $n Т. 3
=250 \\ $a 2. изд.
=260 \\ $c 2000
=300 \\ $a 822 с. $b ил., табл.
=773 18 $7 p1am $g Т. 3 $a Кнут, Дональд Эрвин $t Искусство программирования / Дональд Э. Кнут; Под общ. ред. Ю. В. Козаченко $d М. [ др.] : Вильямс, 2000-____ $h 24 см $k (Классический труд) $w 000848411
=852 \\ $a РГБ $b FB $j 12 00-3/253-9 $x 90
=852 \\ $a РГБ $b FB $j 12 00-3/254-7 $x 90
元数据中的注释
Russian State Library [rgb] MARC:
=001 000680267
=003 RuMoRGB
=005 20010220120000.0
=008 010131s2000\\\\ru\||||\\\\\\\|00\u\rus\d
=017 \\ $a 00-52006 $b РКП
=020 \\ $a 5-8459-0081-6 (рус.)
=020 \\ $a 0-201-89684-2 (англ.)
=035 \\ $a (RuMoRGB)KNO-0134046
=040 \\ $a RuMoRGB $b rus $c RuMoRGB
=041 0\ $a rus
=084 \\ $a З973.2-018я22 $2 rubbk
=245 00 $a Получисленные алгоритмы $n Т. 2
=250 \\ $a 3. изд.
=260 \\ $c 2000
=300 \\ $a 828 с. $b ил., табл.
=773 18 $7 p1am $g Т. 2 $a Кнут, Дональд Эрвин $t Искусство программирования / Дональд Э. Кнут; Под общ. ред. Ю. В. Козаченко $d М. [ др.] : Вильямс, 2000-____ $h 24 см $k (Классический труд) $w 000848411
=852 \\ $a РГБ $b FB $j 12 00-3/253-9 $x 90
=852 \\ $a РГБ $b FB $j 12 00-3/254-7 $x 90
元数据中的注释
Пер.: Knuth, Donald E. The art of computer programming 978-0-201-03804-0
元数据中的注释
Russian State Library [rgb] MARC:
=001 007917064
=005 20220110085135.0
=008 150420m2015\\\\ru\||||\\\\\\\0||\|\rus|d
=020 \\ $a 978-5-8459-1980-9
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=084 \\ $a З973.2-018,0 $2 rubbk
=100 1\ $a Кнут, Дональд Эрвин $d 1938-
=245 00 $a Искусство программирования $h [Текст] $c Дональд Э. Кнут ; [пер. с англ. и ред. И. В. Красикова]
=260 \\ $a Москва [и др.] $b Вильямс $c 2015-
=300 \\ $c 24 см
=490 0\ $a Классический труд. Новое издание
=534 \\ $p Пер.: $a Knuth, Donald E. $t The art of computer programming $z 978-0-201-03804-0
=650 \7 $a Техника. Технические науки -- Энергетика. Радиоэлектроника -- Радиоэлектроника -- Вычислительная техника -- Вычислительные машины электронные цифровые -- Программирование $2 rubbk
=650 \7 $a Программирование(компьют.) $0 RU\NLR\AUTH\661257252 $2 nlr_sh
元数据中的注释
Фактическая дата выхода в свет: 2012
Пер.: Knuth, Donald E. The art of computer programming 978-0-201-03804-0
元数据中的注释
Russian State Library [rgb] MARC:
=001 006505698
=005 20130109155812.0
=008 121219m2013\\\\ru\a\\\\\\\\\\000\|\rus|d
=020 \\ $a 978-5-8459-1744-7 (в пер.)
=040 \\ $a RuMoRKP $b rus $e rcr $d RuMoRGB
=041 1\ $a rus $h eng
=084 \\ $a З973.2-018,0 $2 rubbk
=100 1\ $a Кнут, Дональд Эрвин
=245 00 $a Искусство программирования $h [Текст] $c Дональд Э. Кнут ; [пер. с англ. и ред. И. В. Красикова]
=260 \\ $a Москва [и др.] $b Вильямс $c 2013-
=300 \\ $c 24 см
=490 0\ $a Классический труд
=490 0\ $a Новое издание
=500 \\ $a Фактическая дата выхода в свет: 2012
=534 \\ $p Пер.: $a Knuth, Donald E. $t The art of computer programming $z 978-0-201-03804-0
=650 \7 $a Вычислительная техника -- Вычислительные машины электронные цифровые -- Программирование $2 rubbk
=650 \7 $a Программирование(компьют.) $0 RU\NLR\AUTH\661257252 $2 nlr_sh
元数据中的注释
Russian State Library [rgb] MARC:
=001 010943456
=005 20220110084849.0
=008 150420m2020\\\\ru\||||\\\\\\\0||\u\rus|d
=020 \\ $a 978-5-8459-1980-9
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=044 \\ $a ru
=100 1\ $a Кнут, Дональд Эрвин $d 1938-
=245 00 $a Искусство программирования : $b пер. с англ. $c Дональд Э. Кнут
=260 \\ $a Москва [и др.] $b Диалектика ; $a Санкт-Петербург $b Диалектика $c 2020-
=300 \\ $c 24 см
=490 0\ $a Классический труд. Новое издание
=534 \\ $p Пер.: $a Knuth, Donald E. $t The art of computer programming $z 978-0-201-03804-0
备用描述
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
**
**
Knuth’s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth’s analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems.
*The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient “review” of future volumes could almost be: “Knuth, Volume n has been published.” *
– Data Processing Digest
Knuth, Volume n has been published, where n = 4A.
*In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. *
*The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. *
There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages .
–Frank Ruskey, Department of Computer Science, University of Victoria
The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.
Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org
The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
ISBN: 0321751043
**
备用描述
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient “review” of future volumes could almost be: “Knuth, Volume n has been published.” —Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. —Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library. Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
备用描述
A word from Don Knuth:
For the past 20 years I've been making copious notes in my personal copies of The Art of Computer Programming, whenever I've noticed how those books could be made better. Finally the time is ripe to typeset those books from scratch, using the tools of digital typography that I worked on during the 1980s. The new editions incorporate literally thousands of improvements, including hundreds of instructive new exercises and answers to exercises. I think most readers will enjoy these new things as much as I did when I first learned them. I've been especially careful to include any new historical details that have come to my attention, and to provide up-to-date information about all the research problems stated in previous editions. Computer Science has been changing and growing at a fantastic rate, yet I believe nearly everything in The Art of Computer Programming is crucial information that will never become obsolete.
This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.
Visit Knuth's Home Page
备用描述
Cover 1
Title Page 5
Preface 7
Preface to the Third Edition 8
Notes on the Exercises 11
Contents 14
Chapter 3: Random Numbers 17
Introduction 17
Generating Uniform Random Numbers 26
The Linear Congruential Method 26
Choice of modulus 28
Choice of multiplier 32
Potency 39
Other Methods 42
Statistical Tests 57
General Test Procedures for Studying Random Data 58
Empirical Tests 77
* Theoretical Tests 96
The Spectral Test 109
Other Types of Random Quantities 135
Numerical Distributions 135
Random Sampling and Shuffling 158
* What Is a Random Sequence? 165
Summary 200
Chapter 4: Arithmetic 210
Positional Number Systems 211
Floating Point Arithmetic 230
Single-Precision Calculations 230
Accuracy of Floating Point Arithmetic 245
* Double-Precision Calculations 262
Distribution of Floating Point Numbers 269
Multiple-Precision Arithmetic 281
The Classical Algorithms 281
* Modular Arithmetic 300
* How Fast Can We Multiply? 310
Radix Conversion 335
Rational Arithmetic 346
Fractions 346
The Greatest Common Divisor 349
* Analysis of Euclid's Algorithm 372
Factoring into Primes 395
Polynomial Arithmetic 434
Division of Polynomials 436
* Factorization of Polynomials 455
Evaluation of Powers 477
Evaluation of Polynomials 501
* Manipulation of Power Series 541
Answers to Exercises 554
Appendix A: Tables of Numerical Quantities 742
1. Fundamental Constants (decimal) 742
2. Fundamental Constants (octal) 743
3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers 744
Appendix B: Index to Notations 746
Appendix C: Index to Algorithms and Theorems 751
Index and Glossary 753
备用描述
&>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
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
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
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
This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures—the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.
Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org
**
备用描述
&>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 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 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 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 This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org
备用描述
<p><i>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.</i></p>
<p>—<i>Byte</i>, September 1995</p>
<p class="null1">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.</p>
<p>—Charles Long</p>
<p><i>If you think you're a really good programmer... read [Knuth's]</i> Art of Computer Programming... <i>You should definitely send me a resume if you can read the whole thing.</i></p>
<p>—Bill Gates</p>
<p class="null1">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.</p>
<p>—Jonathan Laventhol</p>
<p>The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.</p>
备用描述
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
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
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
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
The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.
Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org
**
备用描述
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing 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.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each facicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.
备用描述
The first revision of this third volume is the most comprehensive survey of computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and a new discussion of the theory of permutations and of universal hashing.
备用描述
The bible of programming theory and practice is being updated for the first time in more than 20 years. The book is concerned with information structures--the representation of information within a computer, the structural interrelations between data elements and how to work with them efficiently, and applications to simulation, numerical methods and software design
备用描述
Donald Knuth is Professor Emeritus of the Art of Computer Programming at Stanford University, and is well-known worldwide as the creator of the Tex typesetting language. Here he presents the second volume of his guide to computer programming
备用描述
Donald Knuth is Professor Emeritus of the Art of Computer Programming at Stanford University, and is well-known worldwide as the creator of the Tex typesetting language. Here he presents the third volume of his guide to computer programming
备用描述
V. 1. Fundamental Algorithms -- V. 2. Seminumerical Algorithms -- V. 3. Sorting And Searching. Donald E. Knuth. Vol. 3 Published As 2nd Ed. Includes Indexes.
备用描述
v. 1. Fundamental algorithms
v. 2. Seminumerical algorithms
v. 3. Sorting and searching
v. 4, fascicule 3. Generating all combinations and partitions.
开源日期
2021-04-13
更多信息……

🚀 快速下载

成为会员以支持书籍、论文等的长期保存。为了感谢您对我们的支持，您将获得高速下载权益。❤️
如果您在本月捐款，您将获得双倍的快速下载次数。

🐢 低速下载

由可信的合作方提供。 更多信息请参见常见问题解答。 （可能需要验证浏览器——无限次下载！）

所有选项下载的文件都相同，应该可以安全使用。即使这样，从互联网下载文件时始终要小心。例如，确保您的设备更新及时。
显示外部下载
  • 对于大文件，我们建议使用下载管理器以防止中断。
    推荐的下载管理器：JDownloader
  • 您将需要一个电子书或 PDF 阅读器来打开文件，具体取决于文件格式。
    推荐的电子书阅读器：Anna的档案在线查看器、ReadEra和Calibre
  • 使用在线工具进行格式转换。
    推荐的转换工具：CloudConvert和PrintFriendly
  • 您可以将 PDF 和 EPUB 文件发送到您的 Kindle 或 Kobo 电子阅读器。
    推荐的工具：亚马逊的“发送到 Kindle”和djazz 的“发送到 Kobo/Kindle”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起，请考虑购买原版，或直接支持作者。
    📚 如果您当地的图书馆有这本书，请考虑在那里免费借阅。