1 1 vote T(n) = 4T $(\frac{n}{3})$ + n2 Algorithms algorithms time-complexity asymptotic-notations recurrence-relation + – LavTheRawkstar 1.5k views answer comment Share Follow Print See 1 comment 1 1 comment reply LavTheRawkstar commented Feb 3, 2017 reply Follow flag 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 0 replyShare Please log in or register to add a comment.
1 1 vote Use Masters theorem Learner_jai answered Feb 3, 2017 Learner_jai comment Share Follow See all 3 Comments 3 3 Comments reply LavTheRawkstar commented Feb 3, 2017 reply Follow flag dear sir please can you post the second page above two steps clearly i want to solve using iteration only . please sir please 0 0 replyShare Learner_jai commented Feb 3, 2017 reply Follow flag i know only this 0 0 replyShare Learner_jai commented Feb 3, 2017 reply Follow flag I am too trying to clear my basics as much as possible for gate 2018 attempt,,so basically not an expert, 0 0 replyShare Please log in or register to add a comment.
