%20%7C%20Question%2056_0.jpg)
(A) θ(对数log n)
(B) θ(log n)
(C) θ(平方(n))
(D) θ(n)答案： (B)
解释：
T(n) = 2T(√n) + 1
Let n = 2m
==> T(2m) = 2T(2m/2) + 1
Let S(m) = T(2m)
==> S(m/2) = T(2m/2)
Thus above equation will be : S(m) = 2S(m/2) + 1
Applying master’s theorem S(m) = m
Thus : T(n) = Θlog(n) (since n = 2m)
这个问题是http://quiz.geeksforgeeks.org/algorithms-analysis-of-algorithms-question-17-2/的副本
这个问题的测验