engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Solve the following recurrence relation:
T(n) = \(8T(\frac{n}{2})+n^2\)
T(1) = 1
1
\(\Theta(n^2)\)
2
\(\Theta(n^3)\)
3
\(\Theta(n \ log \ n)\)
4
\(\Theta(log \ n)\)