Unformatted text preview: k ≥ 1, design an O ( k log k ) time algorithm to Fnd the k-th smallest key in H . Note that k can be much smaller than n , and thus you cannot assume that log k = Θ(log n ) in general. ( 20 points ) Hint : Your algorithm may make use of a heap data structure, say H . What would your heap H contain and how would your algorithm make use of it? 2. Exercise 4.16, page 88. ( 20 points ) 3. Exercise 4.26, page 89. ( 20 points ) 4. Exercise 4.28, page 89. ( 20 points ) Total Points : 80...
View Full Document
- Spring '11
- Data Structures, Array data structure, Selection algorithm, heap data structure, k-th smallest key