engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Consider the recurrence relation
\(T\left( n \right) = 4T\left( {\frac{n}{2}} \right) + {n^2}\log n\)
Then T(n) is
1
n2
2
n2 log2 n
3
n log n
4
n(log n)2