2 votes 2 votes Algorithms ace-test-series time-complexity master-theorem recurrence-relation algorithms + – smsubham asked Jan 6, 2018 • edited Mar 6, 2019 by Rishi yadav smsubham 534 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Anu007 commented Jan 6, 2018 reply Follow Share O(logn). 0 votes 0 votes Akshay Koli 4 commented Jan 6, 2018 reply Follow Share option b is correct 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes .... Hira Thakur answered Jan 6, 2018 • selected Jan 7, 2018 by smsubham Hira Thakur comment Share Follow See all 2 Comments See all 2 2 Comments reply Sona Barman commented Jan 7, 2018 reply Follow Share I think it should be S(m)=2S(m/2)+1 not S(m)=2T(m/2)+1. 0 votes 0 votes Hira Thakur commented Jan 7, 2018 reply Follow Share yes, you are correct, typo here. 0 votes 0 votes Please log in or register to add a comment.