用最少的(CPU)时间.pptVIP

Data Structures by R.S. Chang, Dept. CSIE, NDHU * * Chapter 2 Algorithm Design Human Problems Result Input Data Structures Processing Output Data Structures Computer Algorithms Chapter 2 Algorithm Design For a problem? What is an Optimal Solution? 用最少的(CPU)時間 (通常是指這點) 用最少的記憶體 Example: Given 4 numbers, sort it to nonincreasing order. Method 1: Sequential comparison 1. Find the largest (3 comparisons) 2. Find the second largest (2 comparisons) 3. Find the third largest (1 comparisons) 4. Find the fourth largest A total of 6 comparisons Chapter 2 Algorithm Design For a problem? What is an Optimal Solution? 用最少的(CPU)時間 (通常是指這點) 用最少的記憶體 Example: Given 4 numbers, sort it to nonincreasing order. Method 2: Somewhat clever method a1 a2 a3 a4 a2 a4 a4 a2 a3 a3 a2 a3 a2 a1 a3 a3 or a1 (4 comparisons) (5 comparisons) Chapter 2 Algorithm Design 2.1 Greedy Algorithms A greedy algorithm takes an action that seems the best at the given time, without consideration of future actions. Example: Coin changing problem Make change for any amount from $0.01 to $0.99 using the fewest number of coins. The available coins are $0.5, $0.25, $0.1, $0.05, and $0.01. $0.94=$0.5+$0.25+$0.1+$0.05+4*$0.01 A total of 8 coins Greedy algorithm works for U.S. coins. But not necessarily so for others. See Exercise 1 in Page 27. Chapter 2 Algorithm Design 2.1 Greedy Algorithms Hill climbing concept Local optimum Global optimum Chapter 2 Algorithm Design 2.2 Divide-and-Conquer Algorithms Example: Finding the minimum number in a list of numbers minimum(a,lower,upper) { if (upper-lower) == 1 return min(a[upper],a[lower]); else return min(minimum(a,lower,(lower+upper)/2), minimum(a,(lower+upper)/2+1,upper)); } Merge sort Quick sort Chapter 2 Algorithm Design 2.2 Divide-and-Conquer Algorithms The closest pair problem d d d For each point near the border, there can be at most six candidates for the closest neighbor across the border. Why? Chapter 2 Algorithm