Time Complexity

Question 1
 
A
B
T(n) = O(n)
C
T(n) = O(log n)
D
None of the above
       Algorithms        Time Complexity       Gate-1997
Question 1 Explanation: 
Apply Master's theorem.
There is 1 question to complete.