0 votes 0 votes Give complete solution $T(n) =T(n-2)+n^2$, if $n >1$ And $1$, if $n=1$ Algorithms algorithms recurrence-relation + – Pun M asked Mar 6, 2018 • edited Mar 14, 2018 by Sukanya Das Pun M 329 views answer comment Share Follow See 1 comment See all 1 1 comment reply shivanisrivarshini commented Mar 6, 2018 i edited by shivanisrivarshini Mar 6, 2018 reply Follow Share I think O(n3) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Correct me if I'm wrong somewhere Ananya Jaiswal 1 answered Mar 6, 2018 Ananya Jaiswal 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes i think O(n^3) BASANT KUMAR answered Mar 26, 2018 BASANT KUMAR comment Share Follow See all 0 reply Please log in or register to add a comment.