This preview shows page 1. Sign up to view the full content.
Unformatted text preview: m , is minimized. 2 Page 173, Excercise 8.3-4. Show how to sort n integers in the range 0 to n 2-1 in O( n ) time 3 Page 384, Exercise 16.2-3. Suppose that in a 0-1 knapsack problem, the order of the items when sorted by increasing weight is the same as their order when sorted by decreasing value. Give an efficient algorithm to find an optimal solution to this variant of the knapsack problem, and argue that your algorithm is correct. 4 Re-consider the problem of constructing the min-order binary tree for array A, A, …, A[ n ] in homework one. Please design a greedy algorithm that needs Θ ( n ) time in worst case. 1...
View Full Document
This note was uploaded on 04/12/2008 for the course CS 592 taught by Professor Shen during the Winter '05 term at University of Missouri-Kansas City .
- Winter '05