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


Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,041 answers
63,230 comments
24,135 users