問題詳情
3.Consider two algorithms whose running times T(n) satisfy the following recurrences: Algorithm A: T(n) = 4T(n/2) + 0(1) Algorithm B: T(n) = 2T(n/4)+ 0(1)
Then, Algorithm A is asymptotically faster than Algorithm B.
(A)O
(B)X
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增