[理工] [資結]時間複雜度

[NOtWorThy ()]

1)  3^n = 2^O(n)  why is true ?

2)  1 = o(1/n)    why false ??

3)  show that (logn)^3 = O(n^(1/16))

4)  let T(n) = 4T(n/2) + n^2 / logn , T(c) = c if c < 2


以上幾題有點問題

煩請高手不吝賜教

謝謝

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 122.116.218.120