Question

GIVEN : F(n) = big-oh(n) + Theta(n) + Big-Omega(n) . question: What is correct option for asymptotic bound for f(n). (please explain your answer.)

(a) big-oh(n) ; (b) Theta(n) ; (c) Big-Omega(n) ; (d) F(n) is Unbounded;

Was it helpful?

Solution

Big-Omega(n) because you need to find the maximum possible time that f(n) will take.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top