chap4-Recurrence 算法导论演示教学.pptVIP

1 Difficulty of Algorithms Research Model 建模 Specify 描述 Correctness 正确性 Verify 验证 Proof 证明 Complex 复杂度 （Efficiency 有效性） Actual computing 实际可计算性 Recurrence is a basic method to analyze algorithm 4 Recurrences Design 设计 Correctness Analysis 正确性分析 Computing Analysis 可计算性分析 2 Algorithms analysis sum 4 Recurrences INSERTION-SORT(A) cost times 1 for( j = 2; j =length[A]; j++) c1 n 2 { key = A[j] c2 n-1 3 // Insert A[j] into the sorted sequence A[1 .. j-1] 0 n-1 4 i = j-1 c4 n-1 5 while( i 0 A[i] key) c5 6 { A[i+1] = A[i] c6 7 i = i-1 c7 8 } 9 A[i+1] = key c8 n-1 10 } 3 Algorithms analysis recursion 4 Recurrences cost MERGE-SORT(A, p, r) T(n) 1 if p r 2 Then q ← 3 MERGE-SORT(A, p, q) T(n/2) 4 MERGE-SORT(A, q+1, r) T(n/2) 5 MERGE(A, p, q, r) n 4 A recurrence is an equation or inequality in terms of one or more base cases, and itself, with smaller arguments. Examples: 4 Recurrences 5 4 Recurrences How to obtain asymptotic “Θ” or “O” bounds on the recurrence solution? Substitution method (置换法) : guesses a bound and then use mathematical induction to prove our guess correct. Iteration method (迭代法) : converts the recurrence into a summation and then relies on techniques for bounding summations to solve the recurrence. Recursion-tree method ( a kind of iteration method ) Master method (主方法，母函数法) : provides bounds for recurrences of the form T(n) = aT(n/b)+f(n), where a ≥ 1, b 1, and f(n) is a given function. 8 neglect certain technical details 1) Assumption of integer arguments to functions 2) Ignore boundary conditions 3) Omit floors, ceilings These details don’t affect the asymptotic bounds of many recurrences encountered in the analysis of algo