9 pages matching merge in this book
Results 1-3 of 9
What people are saying - Write a review
We haven't found any reviews in the usual places.
1 other sections not shown
access probabilities ALLOCATION assume asymptotically average average path length B-optimal balanced tree batch begin bisector bitonic sequence bitonic sort bitonic split cells compare/steer unit Comput consider corresponding cost cycle defined deletion denote distance example expected head travel function given grid head position height-balanced trees heuristic imbedded tree input insertion left edges Lemma loop number lower bound magnetic bubble memory mass storage memory structure memory system merge metric minimize minimum spanning tree minor loops mode Model move Nearest rule Note NP-complete number of comparisons number of control number of steps number of switches oo-optimal rule optimal arrangement optimal solution organ-pipe arrangement output performance permutation algorithm placement problem procedure Proof read/write head recurrence relation result root Schur function shift shown in Figure sorted sequence sorter sorting algorithm Subsection Theorem total number traveling salesman problem two-dimensional Voronoi diagram Voronoi polygon Wong worst-case