1 votes 1 votes T(n) = 4T $(\frac{n}{3})$ + n2 Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Feb 3, 2017 • retagged Jun 4, 2017 by Arjun LavTheRawkstar 817 views answer comment Share Follow See 1 comment See all 1 1 comment reply LavTheRawkstar commented Feb 3, 2017 reply Follow Share how to find genral expression at ith or kth step /stage ? i am not able to find a general expression and not able to solve please help 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Use Masters theorem Learner_jai answered Feb 3, 2017 Learner_jai comment Share Follow See all 3 Comments See all 3 3 Comments reply LavTheRawkstar commented Feb 3, 2017 reply Follow Share dear sir please can you post the second page above two steps clearly i want to solve using iteration only . please sir please 0 votes 0 votes Learner_jai commented Feb 3, 2017 reply Follow Share i know only this 0 votes 0 votes Learner_jai commented Feb 3, 2017 reply Follow Share I am too trying to clear my basics as much as possible for gate 2018 attempt,,so basically not an expert, 0 votes 0 votes Please log in or register to add a comment.
