Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
a: \({n^{1/3}}^{}\)
b : \({e^n}^{}\)
c : \({n^{7/4}}^{}\)
d : n \(lo{g^2}^{}\) n
e : \({(1.001)^n}_{}\)
1
a < b < c < d < e
2
a < d < c < e < b
3
c < d < e < a < b
4
e < a < b < c < d
5
Question Not Attempted