Adobe Interview Question
Software Engineer / Developersby the definition of big-oh
if f(n)=O(g(n)) then there exists some c1 and c2 such that c1*g(n)<=f(n)<=c2*g(n)
in our case f(n)=2^(2n) and g(n)=2^(2n) so we can choose c1 as 0.5 and c2 as 10 to satisfy the cond.
so we can write as 2^(2n)=O(2^(2n))
Can you please explain the question a bit more.
- Bhupesh March 19, 2009