GATE CSE
First time here? Checkout the FAQ!
x
0 votes
76 views

F(n) = 2F(n-1)+1 using back substitution.

Kindly explain like I'm a naive person solving this. Thanks!

 

 

asked in Algorithms by (407 points)  
closed by | 76 views

1 Answer

0 votes
answered by Veteran (36.3k points)  

Related questions

+2 votes
2 answers
1
+1 vote
2 answers
2
+1 vote
1 answer
3
asked in Algorithms by sh!va Veteran (24.7k points)   | 62 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,040 answers
63,230 comments
24,135 users