This preview shows page 1. Sign up to view the full content.
Unformatted text preview: show why. (d) Give a dynamic programming algorithm that yields an optimal solution for an arbitrary set of coin values. 3. A heater is a sort of dual treap, in which the priorities of the nodes are given, but their search keys are generate independently and uniformly from the unit interval [ 0,1 ] . You can assume all priorities and keys are distinct. Describe algorithms to perform the operations INSERT and DELETEMIN in a heater. What are the expected worstcase running times of your algorithms? In particular, can you express the expected running time of INSERT in terms of the priority rank of the newly inserted item? 1...
View Full
Document
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details