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 28
Page 50
... tableau ) . Let P = ( P1 ; ) be a tableau of positive integers , and let x be a positive integer not in P. This algorithm transforms P into another tableau which contains x in addition to its original elements . The new tableau has the ...
... tableau ) . Let P = ( P1 ; ) be a tableau of positive integers , and let x be a positive integer not in P. This algorithm transforms P into another tableau which contains x in addition to its original elements . The new tableau has the ...
Page 59
... tableau , since it is like a tableau except that the " dual order " ( reversing the roles of < and > ) has been used . Let us denote the dual tableau . formed from P in this way by the symbol PS . From PS we can determine P uniquely ...
... tableau , since it is like a tableau except that the " dual order " ( reversing the roles of < and > ) has been used . Let us denote the dual tableau . formed from P in this way by the symbol PS . From PS we can determine P uniquely ...
Page 69
... tableau P formed from the permutation by successive insertion of the elements a1 , a2 , an initially empty tableau . ... " b ) Conversely , prove that any two permutations which have the same P tableau can be transformed into each other ...
... tableau P formed from the permutation by successive insertion of the elements a1 , a2 , an initially empty tableau . ... " b ) Conversely , prove that any two permutations which have the same P tableau can be transformed into each other ...
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