0 0 votes T(n) = 1 + T(n-1) + T(n-2); Given T(0) = 1, T(1) = 2 ; T(2) = 4; Express T(n) in terms of n ? Algorithms algorithms back-substitution + – hacker16 662 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes use recurrence relations shreyansh jain answered Nov 16, 2017 shreyansh jain comment Share Follow 0 reply Please log in or register to add a comment.
