9 votes 9 votes How to solve above recurrence relation (With substitution method)?? Algorithms algorithms master-theorem recurrence-relation time-complexity recursion + – anoop yadav 2 asked Jan 8, 2018 anoop yadav 2 13.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes answer Wii be O(n log4/3 n) using recursive tree method. air1ankit answered Jun 1, 2018 air1ankit comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments bhavnakumrawat5 commented Jul 24, 2018 reply Follow Share i hope it will be help you https://www.cs.cornell.edu/courses/cs3110/2012sp/lectures/lec20-master/lec20.html 2 votes 2 votes nephron commented Oct 30, 2018 reply Follow Share air1ankit u missed Big O notation. 0 votes 0 votes karsh commented Jan 30, 2020 reply Follow Share As in binary tree we go down from 1st level. we divide n into 2 parts then further 2 parts and we keep doing till we reach leaves and that's where height becomes log n base 2. same way here we divide by 3/4 at each level and so it becomes log n base 4/3. 0 votes 0 votes Please log in or register to add a comment.