0 votes 0 votes T(n)= 4T(n//64) + n/log n How to apply Akra Bazi method Here using akra bazi method p will be 1/3 after that how to integrate please tell somebody ? Algorithms algorithms time-complexity recurrence-relation + – LavTheRawkstar asked Feb 1, 2017 retagged Jun 4, 2017 by Arjun LavTheRawkstar 691 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Sarvottam Patel commented Feb 2, 2017 reply Follow Share Is the answer O(n)? 2 votes 2 votes LavTheRawkstar commented Mar 12, 2017 reply Follow Share somebody please tell the solution ? 0 votes 0 votes LavTheRawkstar commented Mar 15, 2017 reply Follow Share Please solve somebody? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes T(n)= 4T(n//64) + n/log n T(n)= aT(n//b) + (n^k)logp n comparing two recurrence , we get a= 4 b=64 k=1 p=-1 a< b^k , p<0 T(n)=O(n^k) = O(n) Arnab Bhadra answered Mar 27, 2017 Arnab Bhadra comment Share Follow See all 0 reply Please log in or register to add a comment.