Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Given \(T\left( n \right) = T\left( {\frac{n}{4}} \right) + T\left( {\frac{n}{2}} \right) + {n^2}\)
Then
1
\(T\left( n \right) = \theta \left( {{n^3}} \right)\)
2
\(T\left( n \right) = \theta \left( {{n^2}\log n} \right)\)
3
\(T\left( n \right) = {\rm{\theta }}\left( {{n^2}} \right)\)
4
\(T\left( n \right) = \theta \left( {{n^3}\log n} \right)\)
5
Question Not Attempted