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)   | 77 views


Top Users May 2017
  1. akash.dinkar12

    3568 Points

  2. pawan kumarln

    2206 Points

  3. Bikram

    1940 Points

  4. sh!va

    1682 Points

  5. Arjun

    1650 Points

  6. Devshree Dubey

    1272 Points

  7. Debashish Deka

    1270 Points

  8. Angkit

    1056 Points

  9. LeenSharma

    1028 Points

  10. Arnab Bhadra

    904 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    1026 Points

  2. pawan kumarln

    832 Points

  3. Arnab Bhadra

    818 Points

  4. akash.dinkar12

    448 Points

  5. Arjun

    378 Points


22,897 questions
29,213 answers
65,336 comments
27,713 users