The Art of Computer ProgrammingThe 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. |
Contents
Chapter 5 Sorting | 1 |
Chapter 6Searching | 392 |
Answers to Exercises | 584 |
Copyright | |
3 other sections not shown
Other editions - View all
Common terms and phrases
a₁ assume asymptotic average number B-tree b₁ balanced trees binary search binary tree blocks bubble sort buffers CACM Compare consider construction contains corresponding defined deletion digital search tree disk distribution elements empty equal example exercise external nodes external path length Fibonacci Fibonacci tree formula given hash function heapsort hence initial runs input integers internal internal sorting JACM K₁ keys linear probing LINK LLINK Math memory merge pattern minimum multiset number of comparisons number of inversions number of probes obtained operations optimum output p₁ pass phase possible priority queue probability problem Program Prove quicksort R₁ radix sort random records replacement selection rewind RLINK search tree Section sequence shows sorting algorithm sorting network step subfile subtree successful search tableau tape Theorem total number