3 votes 3 votes Linear Algebra recurrence-relation + – Parshu gate asked Nov 13, 2017 Parshu gate 457 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Mr_22B commented Nov 13, 2017 reply Follow Share option D is Correct. because They say "Find Complexity". If they say find recurrence equation then I think option C is Correct. 0 votes 0 votes Akash Mittal commented Nov 14, 2017 reply Follow Share shouldn't be it O(1)? 0 votes 0 votes Parshu gate commented Nov 14, 2017 reply Follow Share Given answer is 1 . How? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes I just take some eg here. Here we can also use substitution method which will give GP series of 2n cancellation of series of 2n remaining term is 1, that's another way to approach this problem Hira Thakur answered Nov 14, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes t(n)=2t(n-1)-1 ->4t(n-2)-2-1->8t(n-3)-4-2-1->... t(n)=2nt(n-n)-2n-1-2n-2......-4-2-1 .->..2n-(2n-1/2-1)GPsum => 2n-2n+1=1 hs_yadav answered Nov 14, 2017 hs_yadav comment Share Follow See all 0 reply Please log in or register to add a comment.