Algorithms | Analysis of Algorithms (Recurrences) | Question 4
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1
Which one of the following is false. ( GATE CS 2005)
a) T(n) = O(n^2)
b) T(n) =
(nLogn)
c) T(n) =
(n^2)
d) T(n) = O(nLogn)
(A) A
(B) B
(C) C
(D) D
Answer: (C) Explanation: See question 4 of
https://www.geeksforgeeks.org/data-structures-and-algorithms-set-23/ for explanation.
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...