计概补充.ppt

Greedy Algorithm,Dynamic ProgrammingAlgorithm 蔡文能 CSIE.NCTU.EDU.TW Agenda Complexity: Big O, Big Omega, Big Theta Knapsack problem Greedy Algorithm Making Change problem Knapsack problem Dynamic Programming (DP) DP vs. Divide-and-Conquer Greedy vs. Dynamic Programming Quick Sort, merge Sort C++ STL sort( ), java.util.Arrays.sort( ) Asymptotic Upper Bound (Big O) Asymptotic Lower Bound (Big Omega) Asymptotically Tight Bound (Big Theta) Algorithm types Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Greedy algorithms Divide and conquer algorithms Dynamic programming algorithms Branch and bound algorithms Brute force algorithms Randomized algorithms Knapsack Problem Knapsack Problem: Given n items, with ith item worth vi dollars and weighing wi pounds, a thief wants to take as valuable a load as possible, but can carry at most W pounds in his knapsack. The 0-1 knapsack problem: Each item is either taken or not taken (0-1 decision). The fractional knapsack problem: Allow to take fraction of items. (較簡單) Exp: = (60, 100, 120), = (10, 20, 30), W = 50 Greedy solution by taking items in order of greatest value per pound is optimal for the fractional version, but not for the 0-1 version. The 0-1 knapsack problem is NP-complete, but can be solved in O(nW) time by Dynamic Programming. (A polynomial-time DP??) The Fractional Knapsack Problem Given: A set S of n items, with each item i having bi - a positive benefit wi - a positive weight Goal: Choose items with maximum total benefit but with weight at most W. If we are allowed to take fractional amounts, then this is the fractional knapsack problem. In this case, we let xi denote the amount we take of item i Objective: maximize Constraint: The Fractional Knapsack Algorithm Greedy choice: Keep taking item with highest value (benefit to weight ratio) Since Run time: O(n log n). Why? Correctness: Suppose there is a better solution there is an item i w