When i try to solve this
T(n) = 2T(n/2) + 2
recurrence relation i get order N. But
http://www.geeksforgeeks.org/archives/4583
claims that it is 3/2n-2. The order is still N only but how do we get
the constants ?
--
You received this message because you are subscribed to the Google Groups
3. Consider the following recurrence:
T(n) = 2T(n ^ (1/2)) + 1
Which one of the following is true?
(A) T(n) = (loglogn)
(B) T(n) = (logn)
(C) T(n) = (sqrt(n))
(D) T(n) = (n)
Can we solve this using master theorem???
any other way???
--
You received this message because you are subscribed to
answer is option A .
On Sat, Jul 2, 2011 at 8:32 PM, KK kunalkapadi...@gmail.com wrote:
3. Consider the following recurrence:
T(n) = 2T(n ^ (1/2)) + 1
Which one of the following is true?
(A) T(n) = (loglogn)
(B) T(n) = (logn)
(C) T(n) = (sqrt(n))
(D) T(n) = (n)
Can we solve this using
