In the context of complexity, I have seen both $O(2^{n})$ and $2^{O(n)}$ used.
Whats the difference between the two?
What is the difference between $O(2^{n})$ and $2^{O(n)}$?
1
$\begingroup$
asymptotics
computational-complexity
2 Answers
6
$2^{O(n)}$ is larger. For $O(2^n)$ is exactly functions bounded by $K\cdot 2^n$ for some large $K$, while $2^{O(n)}$ includes things like $4^n = 2^{2n}$, which is not $O(2^n)$.
0
$f(n)=O(2^n)$ means there exists constant $M>0$ such that $\mid f(n) \mid \leq M.2^n$ whereas $f(n)=2^{O(n)}$ means there exists constant $M>0$ such that $\mid f(n)\mid \leq 2^{M.n}$ for large $n$.