Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations

Let f(n) = n! and g(n) = nn be two positive functions of n. Which of the following statements is correct?

1
f(n) = \(o\)(g(n))
2
f(n) = \(\theta\)(g(n))
3
g(n) = \(o\)(g(n))
4
g(n) = \(\omega\)(g(n))
5
Question Not Attempted

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters