What is the asymptotic behaviour of T(n) = T(n/2) + O(n)? Select the tightest bound that holds.单项选择题

A

O(n2)

B

O(log n)

C

O(n)

D

O(n log n)

登录即可查看完整答案

我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

类似问题

In the context of the Master Theorem 𝑇 ( 𝑛 ) = 𝑎 𝑇 ( 𝑛 / 𝑏 ) + 𝑓 ( 𝑛 ) , the total work done by all internal nodes in the recursion tree is primarily determined by:  

What is the asymptotic behavior of T(n) = 2T(n/2) + O(1)? Select the tightest bound that holds.

What is the asymptotic behavior of T(n) = 4T(n/2) + O(n2)? Select tightest bound that holds.

What is the asymptotic behavior of T(n) = 4T(n/2) + O(n3)? Select tightest bound that holds.

更多留学生实用工具

加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！