問題詳情
( )30.Which of the following recurrence relation and asymptotic notation is NOT true?
(A) T(n) = T(n/2) + O(1), T(n) = O(logn)
(B) T(n) = 2T(n/2) +O(1) , T(n) = O(n)
(C) T(n) = 2T(n/2) + O(logn) , T(n) = O(logn)
(D) T(n) = 2T(n/2) +O(n) ,T(n) = O(nlogn)
參考答案
答案：C
難度：適中0.5
書單：沒有書單，新增