0 votes 0 votes Solve the Recurrence using any method T(n)=2 T ($\frac{n}{4}$ ) - n2 Algorithms algorithms recurrence-relation + – LavTheRawkstar asked Mar 27, 2017 • edited Jun 24, 2022 by makhdoom ghaya LavTheRawkstar 559 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes yes, we cant apply masters on -ve sign.. VISH answered Mar 29, 2017 VISH comment Share Follow See 1 comment See all 1 1 comment reply LavTheRawkstar commented Mar 29, 2017 reply Follow Share So dear Sir now please tell 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Check Master's Method Here : https://www.youtube.com/watch?v=lPUhHmgrpik Anup patel answered Mar 28, 2017 Anup patel comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments LavTheRawkstar commented Mar 28, 2017 reply Follow Share I showed this answer to my Phd teacher she said no we cannot solve with negative sign using Master Theorem. 0 votes 0 votes LavTheRawkstar commented Mar 30, 2017 reply Follow Share somebody please tell how to solve it now ?? we cant apply masters. now using other method how can we solve please tell it is very confusing please tell please? 0 votes 0 votes LavTheRawkstar commented Mar 30, 2017 reply Follow Share Where is the video please tell me ?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Using Substitution method, T(n) = O(n2). Decreasing GP: Solving gives approximately 1 because the (common ratio)log n gets subtracted from 1 and common ratio < 1 . for larger values of log n, (common ratio)log n = 0. There are log n terms in this GP. If you ask me O(-n2) is same as O(n2). Visit this link : https://www.quora.com/Is-it-theoretically-possible-for-an-algorithm-to-have-negative-complexity ps: Sorry for cutting and clarity :) Kamal Pratap answered Mar 30, 2017 Kamal Pratap comment Share Follow See all 0 reply Please log in or register to add a comment.