0 votes 0 votes Show that the solution of $T(n) = T(n-1)+ n$ is $O(n^2)$ Algorithms cormen algorithms recurrence-relation descriptive + – akash.dinkar12 asked Apr 5, 2019 retagged Apr 5, 2019 by akash.dinkar12 akash.dinkar12 146 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.