The Art of Computer Programming
The first revision of this third volume is the most comprehensivesurvey of classical computer techniques for sorting and searching. It extends thetreatment of data structures in Volume 1 to consider both large and smalldatabases and internal and external memories. The book contains a selection ofcarefully checked computer methods, with a quantitative analysis of theirefficiency. Outstanding features of the second edition include a revised sectionon optimum sorting and new discussions of the theory of permutations and ofuniversal hashing.
57 pages matching Prove in this book
Results 1-3 of 57
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
aiao Algorithm H an-i approximation assume asymptotic binomial tree bit string blocks C2ci Chase's sequence coefficient combination ct combinatorial compositions compute conjugate contingency table corresponds ct-i decreasing defined Durfee square elements equivalent Eulerian trail exactly example F. S. Macaulay Ferrers diagram Find formula function genlex order Gray code Gray path Hamiltonian paths hence increasing induction integer partition largest lexicographic order lexicographically smallest loopless Math modulo multicombinations multiset n-tuples namely near-perfect node notation number of partitions obtained otherwise set permutations polynomial previous exercise proof Prove random partition recurrence representation restricted growth strings revolving-door rightmost rook saddle point saddle point method scheme Section set Cj set partitions Show simplicial complex solution step Stirling's approximation t-combinations Table Theorem total number tree universal cycle vectors zero