0 votes 0 votes T(n) = 2 T(n) + n Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Feb 2, 2017 • retagged Jun 4, 2017 by Arjun LavTheRawkstar 318 views answer comment Share Follow See 1 comment See all 1 1 comment reply Debasmita Bhoumik commented Feb 2, 2017 reply Follow Share is it a typo? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes its not a recurrence relation! Debasmita Bhoumik answered Feb 2, 2017 Debasmita Bhoumik comment Share Follow See all 2 Comments See all 2 2 Comments reply LavTheRawkstar commented Feb 2, 2017 reply Follow Share it is a recurrence relation mam just masters theorem cannot be applied. but now how to solve it even i dont know 0 votes 0 votes Debasmita Bhoumik commented Feb 2, 2017 reply Follow Share Tn=2Tn+n⟹Tn=−nTn=2Tn+n⟹Tn=−n Why is this a recurrence relation? In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms. (wiki) 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes T(n) = 2T(n) + n changing side of T(n), T(n) = - n So, I think it should be order of O(1) Since, negative doesn't make sense. lifeisshubh answered Feb 2, 2017 lifeisshubh comment Share Follow See all 0 reply Please log in or register to add a comment.
