0 votes 0 votes Algorithms made-easy-test-series recurrence-relation time-complexity numerical-answers + – hs_yadav asked Dec 15, 2017 • retagged Jul 8, 2022 by Lakshman Bhaiya hs_yadav 363 views answer comment Share Follow See 1 comment See all 1 1 comment reply hs_yadav commented Dec 15, 2017 reply Follow Share @ Ashwin Kulkarni actually given answer is 2.32 ..... 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Answer is 1 + 5 + 52 + 53 ...... + 5logn => 1(5logn+1 -1)/4 analyze the term 5logn+1 => 5.5logn => 5.5$\frac{logn}{log5}*log5$ => 5.5$\log_{5}^{}\textrm{n}$ * log5 => 5.nlog5 => 5.n2.33 Hence ans => 1(5.n2.33 -1)/4 = O(n2.33 ) Ashwin Kulkarni answered Dec 15, 2017 Ashwin Kulkarni comment Share Follow See all 0 reply Please log in or register to add a comment.