GATE CSE
First time here? Checkout the FAQ!
x
0 votes
88 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 Active (2.3k points)  
closed by | 88 views

1 Answer

0 votes
answered by Veteran (37.3k points)  


Top Users Aug 2017
  1. ABKUNDAN

    4658 Points

  2. Bikram

    4126 Points

  3. akash.dinkar12

    3144 Points

  4. rahul sharma 5

    2916 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2390 Points

  7. just_bhavana

    2058 Points

  8. Tesla!

    1782 Points

  9. pawan kumarln

    1574 Points

  10. learner_geek

    1558 Points


24,892 questions
31,967 answers
74,207 comments
30,083 users