2 votes 2 votes $T(n)=3T(n/3-2)+n/2$ Find the tightest bound. Algorithms algorithms recurrence-relation + – Sunny123 asked Jul 26, 2016 Sunny123 357 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Use iterative method for solving this. We can't ignore anything Ashwani Kumar 2 answered Jul 27, 2016 Ashwani Kumar 2 comment Share Follow See 1 comment See all 1 1 comment reply Sunny123 commented Jul 27, 2016 reply Follow Share can you pleasse give the solution .. 0 votes 0 votes Please log in or register to add a comment.