# Did I select the correct answer? Time complexity of algorithms.

The question is whether it is true or false that: $$42 \log n +\sqrt n +n^{1/3} = \Omega(n^{1/3}).$$

I chose that the statement is true since the function on the left will always grow faster than $$n^{1/3}$$ because of the term $$\sqrt{n}$$.

• Yes, you got that right. It is also $\Omega(\lg n)$. – LeBlanc Mar 4 at 7:44