2 votes 2 votes $T(n)= 7 T (\frac{n}{3}) + n^2 $ Algorithms algorithms time-complexity recurrence-relation + – LavTheRawkstar asked Feb 1, 2017 edited Jan 10 by Hira Thakur LavTheRawkstar 489 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes T(n)= 7 T (n/3) + n2 T(n)= a T (n/b) + nklogp(n) Comparing both the equation we get , a=7 b=3 k=2 p=0 and a<bk ,p>=0 T(n) = O(nk logp(n) ) T(n)= O(n2) Arnab Bhadra answered Mar 28, 2017 Arnab Bhadra comment Share Follow See all 0 reply Please log in or register to add a comment.