Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Consider the following functions :
f(n) = 3n√n
g(n) = \(2^{\Gamma n}\) \(\rm \log_2^n\)
h(n) = n!
Which of the following is true ?
1
h(n) is 0 (f(n))
2
h(n) is 0 (g(n))
3
g(n) is not 0 (f(n))
4
f(n) is 0 (g(n))