問題詳情
【題組】(36) What is the runtime overhead of a divide-and-conquer algorithm that recursively processes two equal halves of a problem that each have an overhead of O(n)?
(A)O(n log n)
(B)O(log n)
(C)O(n2)
(D)O(n3)
(E)O(n)
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增