1 votes 1 votes T(n)= T($\frac{n}{2}$) + $\frac{n^{2}}{2}$ + n Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Feb 1, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 329 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes T(n) = O(n2) naveen81 answered Feb 1, 2017 selected Feb 1, 2017 by saurabh rai naveen81 comment Share Follow See all 2 Comments See all 2 2 Comments reply LavTheRawkstar commented Feb 1, 2017 reply Follow Share can you please tell how to solved it ? i dont want answer i want the method and approach how you solved. 0 votes 0 votes naveen81 commented Feb 1, 2017 reply Follow Share Using iterative approach 1 votes 1 votes Please log in or register to add a comment.