0 votes 0 votes The recurrence equation: T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n Solution: Option (a) Algorithms algorithms recurrence-relation + – Mak Indus asked Nov 5, 2018 edited Jun 22, 2022 by makhdoom ghaya Mak Indus 755 views answer comment Share Follow See 1 comment See all 1 1 comment reply goxul commented Nov 5, 2018 reply Follow Share https://math.stackexchange.com/questions/239974/solve-the-recurrence-tn-2tn-1-n 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It can be solved by substitution method. Edit: multiply by common ratio in image 1. Peeyush Pandey answered Nov 5, 2018 Peeyush Pandey comment Share Follow See all 0 reply Please log in or register to add a comment.