0 votes 0 votes closed with the note: Done T(n) = T(n-1) + n In which case it falls ?? Algorithms algorithms time-complexity master-theorem + – aka 53 asked Nov 22, 2017 closed Nov 22, 2017 by aka 53 aka 53 342 views comment Share Follow See all 4 Comments See all 4 4 Comments reply Rupendra Choudhary commented Nov 22, 2017 reply Follow Share which case means what ? 0 votes 0 votes just_bhavana commented Nov 22, 2017 reply Follow Share master's theorem is not applicable in this case!! 3 votes 3 votes aka 53 commented Nov 22, 2017 reply Follow Share Ok got it 0 votes 0 votes debasree88 commented Apr 25, 2019 reply Follow Share In master's theorem the form should be T(n/b)... Can T(n-1) be converted in T(n/b) form??? 0 votes 0 votes Please log in or register to add a comment.