Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Arrange the following recurrence relations in increasing order of their time capacity.
(A) T(n) - T(n/2) + 1
(B) T(n) = 2T(n/2) + n
(C) T(n) = 3T(n/3) + n
(D) T(n) = 2T(n/2) + √n
(E) T(n) =T(n - 1) + 1
Choose the correct answer from the options given below:
1
(E), (A), (B), (D), (C)
2
(A), (E), (D), (B), (C)
3
(E), (A), (D), (B), (C)
4
(A), (B), (D), (E), (C)