engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Which of the following recurrence relation can be solved using Master Theorem?
1
T(n) = 64T(n/8) - n
2
T(n) = 2T(n/2) + n/(log n)
3
T(n) = 2T (n/2) + 1
4
T(n) = 2nT(n/2) +n