演算法课程AlgorithmsCourse2递回Recursion.pptVIP

*範例2若遞迴式T(n)=T(n/3)+T(2n/3)+n，試求T(n)=?(?)。(90,91台大類似題)Sol:(若要計算?得用“夾擠法”，?分別計算O和?)(1)先求Big-O(即:求Upperbound)Step1:(按照遞迴式展開)*Step2:(計算每一層之cost)nnnleaf=nn*log3n高度h’?n→2/3n→4/9n→…→1n?(2/3)h=1,0≤hh=log3/2n?高度?=log3/2n+1分析“高度h?”n→n/3→n/9→…→1n?(1/3)h’=1,0≤h’h’=log3n?高度?=log3n+1分析“高度h’?”高度h?*(1)先求Big-O(即:求Upperbound)Step3:Totalcost=n+n+n+…+leaf(公比r=1，不能用無窮等比級數來賴皮)