The Art of Computer Programming: Sorting and searching
Addison-Wesley Publishing Company, 1973 - Computer algorithms - 723 pages
Finally, 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
We haven't found any reviews in the usual places.
Other editions - View all
Algorithm appear applied assume average number balanced beginning better binary bound called columns comparisons complete consider construction contains corresponding decrease defined deletion determine discussed distribution efficient elements empty equal exactly example exchange exercise external fact final formula function given gives hash hence idea increasing initial input insertion interesting internal inversions keys largest least length less LINK memory merge method move multiset namely node Note number of comparisons obtained occurs operations output pairs pass path permutation phase position possible probability problem procedure Program proof Prove radix sorting random records relation replacement represented requires result runs selection sequence shows simple smallest sorting step takes tape Theorem tree units