26 views

What is the tightest upper bound to $T(n) = T(n-1) + 2^n$?

• $O(n2^n)$
• $O(2^n)$
• $O(2^{2n})$
• None
closed as a duplicate of: Time Complexity