0 votes 0 votes T(n) = T(floor(n/2)) + T(ceil(n/2)) + 2 How to solve this recurrence to get 3/2n -2? Algorithms recurrence-relation + – itachi asked Jan 13, 2017 itachi 529 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.