1 votes 1 votes T(n)=T(n/5)+T(7n/10)+an a: constant what will be the time complexity of the above recurrence relation?? Please share the approach for this kind of recurrence relation Algorithms algorithms recurrence-relation time-complexity divide-and-conquer + – lalitver10 asked Jan 4, 2022 lalitver10 608 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shoto commented Jan 4, 2022 reply Follow Share Refer: https://gateoverflow.in/357421/Gate-cse-2021-set-1-question-30 It’s similar problem 1 votes 1 votes ankitgupta.1729 commented Jan 4, 2022 reply Follow Share replace $n$ with $a*n$ here .. $T(n) \in \Theta(n)$ 2 votes 2 votes prajjwal_191 commented Aug 11, 2023 reply Follow Share We can Use recursive tree method to solve these types of recurrence relations, where more than 1 function calls are there. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes @lalitver10 Here is the Solution... 1. https://gateoverflow.in/43840/How-to-solve-reccurence-relation-type-7n-plz-specify-detail 2. https://gateoverflow.in/255452/Recurrence-relation 3. https://web.stanford.edu/class/archive/cs/cs161/cs161.1168/lecture3.pdf aaa 1 answered Jan 4, 2022 aaa 1 comment Share Follow See 1 comment See all 1 1 comment reply lalitver10 commented Jan 4, 2022 reply Follow Share @aaa 1 Thanks For Sharing Resources . 0 votes 0 votes Please log in or register to add a comment.