問題詳情

26. Consider the following five recursive functions:
(A)


(B)


(C)


(D)


(E)

Which recursion yields the highest asymptotic complexity for T(n)?

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增