反馈文件质量
upload/bibliotik/T/The Art of Computer Programming Volume 3 (2nd Edition) - Donald E. Knuth.pdf
Art of Computer Programming, The : Volume 3: Sorting and Searching 🔍
Donald E. Knuth, Donald Knuth Addison-Wesley Professional, 3, 2, 1998
英语 [en] · PDF · 16.5MB · 1998 · 📘 非小说类图书 · 🚀/lgli/upload/zlib · Save
描述
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.
备用文件名
lgli/Knuth, Donald - Art of Computer Programming, The: Volume 3: Sorting and Searching (1998, Addison-Wesley Professional).pdf
备用文件名
zlib/Computers/Programming/Knuth, Donald/Art of Computer Programming, The: Volume 3: Sorting and Searching_11998157.pdf
备选标题
The Art of Computer Programming: Volume 3: Sorting and Searching
备选标题
Сортировка и поиск: Т. 3
备选作者
[by] Donald E. Knuth
备选作者
Donald Ervin Knuth
备用出版商
Da Capo Press, Incorporated
备用出版商
Addison-Wesley Pub. Co.
备用出版商
Hachette Books
备用出版商
Basic Books
备用版本
Addison-Wesley series in computer science and information processing, Reading, Mass, Massachusetts, 1973
备用版本
3rd ed., Reading, Mass, Massachusetts, 1997
备用版本
United States, United States of America
备用版本
2nd ed, Reading Mass. ; Harlow, ©1998
备用版本
Pearson Education (US), [N.p.], 1998
备用版本
Reading, Mass, ©1997-<2022>
备用版本
Second Edition, PS, 1998
备用版本
2nd ed., England, 1998
备用版本
2. изд., Russia, 2000
元数据中的注释
producers:
MSP - Mathematical Sciences Publishers
元数据中的注释
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.
元数据中的注释
РГБ
元数据中的注释
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
备用描述
<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
备用描述
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.
备用描述
This first volume begins with basic programming concepts and techniques, then focuses 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
备用描述
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”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起，请考虑购买原版，或直接支持作者。
    📚 如果您当地的图书馆有这本书，请考虑在那里免费借阅。