Show that g(n) is O(g(n)) for each of the following [closed]

问题

Closed. This question needs to be more focused. It is not currently accepting answers.

---

Want to improve this question? Update the question so it focuses on one problem only by editing this post.

Closed last year.

2^(sqrt(log(n)) is O(n(^4/3))

n^(4/3) is O(n(log(n))^3)

n(log(n))^3) is O(n^(log(n))

n^(log(n)) is O(2^n)

I can do it for them when they have the same base; I can't figure it out when they don't have the same base--I know that these are all true.

回答1:

Take log on both sides, for each of them. This is permitted because log is a monotonically increasing function

来源：https://stackoverflow.com/questions/52547806/show-that-gn-is-ogn-for-each-of-the-following