The Art of Computer Programming: Sorting and searchingFinally, 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. The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043 |
What people are saying - Write a review
Reviews aren't verified, but Google checks for and removes fake content when it's identified
LibraryThing Review
User Review - EmreSevinc - LibraryThing"I thought that I was a perfectionist until I met Knuth." The previous sentence is from the renowned mathematician Fan Rong K Chung Graham and I think it also reflects the spirit of the masterpiece of ... Read full review
LibraryThing Review
User Review - coclimber - LibraryThingJust seeing this title again brought back many memories of this being the "bible" of computer science back in my grad school days -- a very, very, very long time ago. Knuth's volumes were absolutely ... Read full review
Contents
Chapter 5Sorting | 1 |
Chapter 6Searching | 389 |
Answers to Exercises | 571 |
Copyright | |
1 other sections not shown
Other editions - View all
Common terms and phrases
actually Algorithm appear applied assume average number balanced beginning better binary buffers Compare comparisons complete consider construction contains corresponding defined deletion determine distribution efficient elements empty equal exactly example exercise external fact fields final formula function given gives hash hence idea increasing initial runs input insertion interesting internal inversions keys largest least length less memory merge method move multiset namely node Note obtained occurs operations optimum Otherwise output pass path pattern permutation Phase position possible probability probes problem Program proof Prove radix sorting random records relation replacement represented requires result rewind root runs selection sequence shows simple sorting step successful takes tape Theorem tree units write
References to this book
Bibliographic information
| Title | The Art of Computer Programming: Sorting and searching Volume 3 of Addison-Wesley series in computer science and information processing, ISSN 2691-2651 Addison-Wesley series Computer science and information processing Goldstine Printed Materials Volume 3 of Softing and searching Volume 3 of The Art of Computer Programming V.3: Sorting and Searching, Donald Ervin Knuth Volume 3 of The Art of Computer Programming, Donald Ervin Knuth World student series editions |
| Authors | Knuth, Ervin Knuth, Donald Ervin Knuth |
| Editors | Richard S. Varga, Addison-Wesley (1942-1999)., Michael A. Harrison |
| Edition | 2, illustrated, reprint |
| Publisher | Addison-Wesley Publishing Company, 1973 |
| Original from | the University of Michigan |
| Digitized | Nov 16, 2007 |
| ISBN | 020103803X, 9780201038033 |
| Length | 723 pages |
| Export Citation | BiBTeX EndNote RefMan |