engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Consider the recurrence relation:
T(n) = 16T(n/4) + n!
Above recurrence relation represents the running time of an algorithm. Which of the following represents the time complexity of the algorithm?
1
\(\theta(n)\)
2
\(\theta(log \ n)\)
3
\(\theta(n\ log\ n)\)
4
\(\theta(n!)\)