2 votes 2 votes T(n)=4T(n/2)+n TC using iterative method with steps in short :) T(1) = 1 Algorithms algorithms recurrence-relation time-complexity + – gauravkc asked Jan 24, 2018 retagged Jul 9, 2022 by Lakshman Bhaiya gauravkc 319 views answer comment Share Follow See 1 comment See all 1 1 comment reply Anand. commented Jun 18, 2018 reply Follow Share is it $O(n^2)?$ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes What is its time complexity? Mansi Sharma 1 answered Jun 18, 2018 Mansi Sharma 1 comment Share Follow See all 0 reply Please log in or register to add a comment.