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 |
From inside the book
Results 1-3 of 16
Page 531
... number of probes for the ( i + 1 ) st is decreased by the same amount that the number for the ith is increased . □ a1 ... Theorem P tells us that the average search length for a hash sequence a1 a2 ... an can be determined from the numbers ...
... number of probes for the ( i + 1 ) st is decreased by the same amount that the number for the ith is increased . □ a1 ... Theorem P tells us that the average search length for a hash sequence a1 a2 ... an can be determined from the numbers ...
Page 538
... number of overflow records will increase substantially if the file is ... probes . But this does not tell the whole story , since the time per probe ... probes to locate a random item . in the table . ( However , the average number of ...
... number of overflow records will increase substantially if the file is ... probes . But this does not tell the whole story , since the time per probe ... probes to locate a random item . in the table . ( However , the average number of ...
Page 546
... number of probes made by Algorithm L. [ What was there about the derivation of ( 51 ) that wasn't rigorously exact ? ] ▻34 . [ M22 ] The purpose of this exercise is to investigate the average number of probes in a chained scatter table ...
... number of probes made by Algorithm L. [ What was there about the derivation of ( 51 ) that wasn't rigorously exact ? ] ▻34 . [ M22 ] The purpose of this exercise is to investigate the average number of probes in a chained scatter table ...
Contents
Tableaux and Involutions | 48 |
Chapter 6Searching | 389 |
Answers to Exercises | 571 |
Copyright | |
2 other sections not shown
Common terms and phrases
a₁ assume asymptotic average number B-tree b₁ balanced trees binary search binary tree bubble sort buffers CACM CMPA Compare consider contains corresponding decreasing defined deletion digit digital search tree distribution elements empty ENT1 equal example exercise external nodes external path length Fibonacci Fibonacci tree formula function hash heapsort hence initial runs input integers internal sorting K₁ keys largest linear probing LINK LLINK log2 memory merge pattern minimum multiset number of comparisons number of inversions number of probes obtained operations optimum output permutation phase position possible priority queue probability problem Program Prove quicksort radix sorting random records replacement selection rewind RLINK search tree Section sequence shows smallest sorting algorithm sorting method sorting network step subfile successful search tableau tape Theorem total number