UGC-NET | UGC NET CS 2017 Jan – III | Question 31

The asymptotic upper bound solution of the recurrence relation given by

Recurrence relation

(A)

O(n²)

(B)

O(n log n)

(C)

O(n log log n)

(D)

O(log log n)

Answer: (C)
Explanation:

We will apply master theorem in this question: a = 2, b = 2 and k =1 and p = -1. we will comapare a and b^k ie

2 = 21 and we have p = -1
Then T(n) = Θ(nlog22log log n)
     T(n) = Θ(nlog log n)   
and Θ(n log log n) >= O(n log log n)

So, option (C) is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post