GATE CSE
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 (8.6k points)  
closed by | 26 views

Related questions

+1 vote
1 answer
1
asked in Theory of Computation by vaishali jhalani Boss (6k points)   | 68 views


Top Users Mar 2017
  1. rude

    4008 Points

  2. sh!va

    2984 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2604 Points

  5. Debashish Deka

    2050 Points

  6. 2018

    1406 Points

  7. Vignesh Sekar

    1292 Points

  8. Bikram

    1204 Points

  9. Akriti sood

    1162 Points

  10. Sanjay Sharma

    964 Points

Monthly Topper: Rs. 500 gift card

21,435 questions
26,746 answers
60,901 comments
22,916 users