2 votes 2 votes Algorithms ace-test-series recurrence-relation + – rasto mapp asked Jan 20, 2018 • retagged Jun 28, 2022 by makhdoom ghaya rasto mapp 255 views answer comment Share Follow See 1 comment See all 1 1 comment reply hs_yadav commented Jan 20, 2018 reply Follow Share option D.... 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes Answer is B) Θ ( log n) EDIT: At second last statement (2 *log2 n) + (2log(logn)) - (1) = 2 *log2 n + log2 n - 1 = (3 * log2 n) -1 (//small calculation mistake please take care) Sorry for handwriting and clarity :) Hope it helps:) Kamal Pratap answered Jan 20, 2018 • edited Jan 21, 2018 by Kamal Pratap Kamal Pratap comment Share Follow See 1 comment See all 1 1 comment reply rasto mapp commented Jan 20, 2018 reply Follow Share Thnk You.Much appreciated :) 0 votes 0 votes Please log in or register to add a comment.
