1 votes 1 votes T(n) = T(n-1) + n4 Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Feb 4, 2017 • retagged Jun 4, 2017 by Arjun LavTheRawkstar 799 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Hemant Parihar commented Feb 4, 2017 reply Follow Share T(n) = n4 + (n-1)4 + (n-2)4 + (n-3)4 + ........... 34 + 24 + 14 0 votes 0 votes LavTheRawkstar commented Feb 4, 2017 reply Follow Share respected dear sir please post the full answer i am not able to derive it at the i th or kth step/stage i am getting confused how to write general expression please post full answer please 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes See this Smriti012 answered Feb 4, 2017 Smriti012 comment Share Follow See all 3 Comments See all 3 3 Comments reply LavTheRawkstar commented Feb 4, 2017 reply Follow Share answer is coming T(n) = O (n5 ) 0 votes 0 votes Smriti012 commented Feb 4, 2017 reply Follow Share Yes answer is O(n5) Summation of n^4 was done incorrectly in the above image !! See this : 0 votes 0 votes Amit puri commented Sep 29, 2017 reply Follow Share answer is n^5 ..select the correct answer properly 0 votes 0 votes Please log in or register to add a comment.
