← Back Trick for Analyzing Recursive Time Complexity Apr 9, 2026 Protected content 请输入课程内容访问密码 Unlock Incorrect password. T(n)=T(an)+T(bn)+O(n)T(n)=T(an)+T(bn)+O(n)T(n)=T(an)+T(bn)+O(n) if a+b=1a+b=1a+b=1: T(n)=O(nlogn)T(n)=O(nlogn)T(n)=O(nlogn) else if a+b<1a+b<1a+b<1: T(n)=O(n)T(n)=O(n)T(n)=O(n)