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
Top Users Feb 2017
  1. Arjun

    4694 Points

  2. Bikram

    4004 Points

  3. Habibkhan

    3738 Points

  4. Aboveallplayer

    2966 Points

  5. sriv_shubham

    2278 Points

  6. Smriti012

    2212 Points

  7. Arnabi

    1814 Points

  8. Debashish Deka

    1788 Points

  9. sh!va

    1444 Points

  10. mcjoshi

    1444 Points

Monthly Topper: Rs. 500 gift card

20,788 questions
25,938 answers
59,535 comments
21,929 users