The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x

Algo rec [closed]

0 votes
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
asked in Algorithms by Boss (9.2k points)
closed by | 26 views


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,981 questions
36,818 answers
91,197 comments
34,706 users