3 votes 3 votes What is Time Complexity of 4T ( n /2 ) + n / logn ? Algorithms algorithms time-complexity recurrence-relation + – Nikhil Patil asked Aug 15, 2017 Nikhil Patil 475 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shubhanshu commented Aug 15, 2017 reply Follow Share I used the form of $T(n) = aT(\frac{n}{b})+n^klog^pn$ where a = 4, b = 2, k = 1, p = -1. is it wrong? 0 votes 0 votes Rishabh Gupta 2 commented Aug 17, 2017 reply Follow Share Is the answer O(n<sup>2</sup>)?? 0 votes 0 votes Shubhanshu commented Aug 17, 2017 reply Follow Share yes, but did you solve it from substitution method? 0 votes 0 votes Please log in or register to add a comment.
