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 |
Contents
Chapter 6Searching | 389 |
Answers to Exercises | 571 |
Appendix ATables of Numerical Quantities | 701 |
Copyright | |
Other editions - View all
Common terms and phrases
a₁ assume asymptotic average number B-tree b₁ balanced trees binary search binary tree bitonic sorter bubble sort buffers CACM CMPA Compare consider contains corresponding decrease defined deletion digital search tree distribution elements empty equal example exercise external nodes external path length Fibonacci Fibonacci tree formula heapsort hence initial runs input integers internal sorting K₁ keys linear probing LINK LLINK log2 memory merge pattern minimum multiset number of comparisons number of inversions number of probes operations optimum output permutation Phase polyphase merge position possible priority queue probability problem Program Prove quicksort radix sorting random records replacement selection requires rewind RLINK search tree Section sequence shows smallest sorting algorithm sorting method sorting network step straight insertion subfile subtree successful search tableau tape Theorem total number