能有效率地排序小数字的演算法.pptxVIP

Chapter 2;;2.2 Analyzing Algorithms ? RAM: Random-access machine, 在此機器上執行記憶體存取只需一單位的時間，且指令是依序一個一個執行。 ? Running time: 執行的步驟的總數量，以 input size 的函數來表示之。;範例: Insertion Sort Insertion-Sort(A) 1 for j ← 2 to length[A] 2 do key ← A[j] 3 ?insert A[j] into the sorted sequence A[1..j - 1] 4 i ← j – 1 5 while i 0 and A[i] key 6 do A[i + 1] ← A[i] 7 i ← i – 1 8 A[i + 1] ← key T(n) = c1n+(c2+c4+c8)(n-1)+c5 +(c6+c7);Best-case: Each tj=1. (輸入 A 是排序好的) T(n) = (c1+c2+c4+c5+c8)n-(c2+c4+c5+c8) = ?(n) (rate of growth, order of growth) Worst-case: (upper bound) Each tj=j. T(n) = k1n2 + k2n + k3 = ?(n2); Average-case: (Expected running time) Each tj=j/2 T(n) = t1n2 + t2n + t3 = ?(n2) (rate of growth, order of growth);2.3 Designing Algorithms Divide-and-Conquer: Divide:(把大問題切成幾個比較小的相同問題) Conquer:(解決問題) Combine:(把小問題的解合成大問題的解); 範例: Merge SortAnalysis: (recurrence) T(n) = = ?(nlog n);Exercises;以下是一個輸出入的實例:;Exercises;Exercises;以下是一個輸出入的實例: